A nonlinear bound for the number of subsequence sums
Vsevolod F. Lev

TL;DR
This paper establishes a lower bound on the number of distinct subsequence sums for zero-sum-free sequences over abelian groups, revealing a nonlinear relationship unless the sequence is structurally constrained.
Contribution
It introduces a nonlinear lower bound on subsequence sums for zero-sum-free sequences and characterizes sequences that do not meet this bound.
Findings
Zero-sum-free sequences have at least c|α|^{4/3} distinct subsequence sums.
Sequences with fewer sums are structurally controlled by few terms.
The bound is tight up to a constant factor.
Abstract
We show that a finite zero-sum-free sequence over an abelian group has at least distinct subsequence sums, unless is "controlled" by a small number of its terms; here denotes the number of terms of , and is an absolute constant.
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
TopicsLimits and Structures in Graph Theory · Computability, Logic, AI Algorithms · graph theory and CDMA systems
