Zero-sum free sequences with small sum-set
Gautami Bhowmik (LPP), Immanuel Halupczok (DMA), Jan-Christoph, Schlage-Puchta
TL;DR
This paper investigates the minimal size of the set of all subset-sums for zero-sum free subsets of integers modulo n, providing exact results for subsets of size up to 7.
Contribution
It computes the minimal subset-sum set sizes for zero-sum free subsets of size up to 7, advancing understanding of their additive structure.
Findings
Exact minimal subset-sum sizes for k ≤ 7
Characterization of zero-sum free subsets with small sum-sets
New bounds on sum-set sizes in modular groups
Abstract
Let A be a zero-sum free subset of Z_n with |A|=k. We compute for k\le 7 the least possible size of the set of all subset-sums of A.
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 · Mathematical Approximation and Integration · semigroups and automata theory