TL;DR
This paper introduces a new upper bound for B_3 sequences, which are sequences of non-negative integers with all sums of three elements distinct, advancing understanding of their limitations.
Contribution
The paper provides a novel upper bound for B_3 sequences, improving previous bounds and contributing to the theory of additive combinatorics.
Findings
New upper bound for B_3 sequences
Enhanced understanding of sum-distinct sequences
Progress in additive combinatorics theory
Abstract
A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new upper bound for B_3 sequences.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · Digital Image Processing Techniques