The maximum size of sumsets in finite cyclic groups
Vivekanand Goswami, Raj Kumar Mistri

TL;DR
This paper investigates the maximum sizes of sumsets in finite cyclic groups, showing that for any fixed h, there are infinitely many cases where these sizes are strictly less than the known upper bounds, addressing a problem posed by Bajnok.
Contribution
The paper proves the existence of infinitely many instances where sumset sizes in cyclic groups are below the optimal bounds, partially solving Bajnok's problem.
Findings
Infinitely many m and n exist where sumset sizes are below bounds.
Results apply to sumsets, restricted sumsets, and union of sumsets.
Provides partial solutions to Bajnok's posed problems.
Abstract
Let be a nonempty finite subset of an additive abelian group . Given a nonnegative integer , the -fold sumset is the set of all sums of elements of , and the restricted -fold sumset is the set of all sums of distinct elements of . The union of restricted sumsets , where , is denoted by . For fixed positive integers and , the maximum size of the sumset of a set with elements is denoted by . In other words, . Analogous quantities can be defined for the sumsets and . Optimal upper bounds are known for these quantities. If is a finite cyclic group of order , then each of these quantities agrees with the optimal upper bound, except in many cases. Bajnok posed the…
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 · Finite Group Theory Research · Graph theory and applications
