A generalization of sumsets modulo a prime
Francesco Monopoli

TL;DR
This paper extends the understanding of generalized sumsets by establishing lower bounds for their sizes in modular arithmetic over prime fields and revisiting classical results in the integers.
Contribution
It generalizes known results from integers to prime modular groups, providing new bounds and proofs for sumset structures and sizes.
Findings
Lower bounds for |h^{(r)}A| in prime modular groups
Structural characterization of sumsets with minimal size
New proofs for sumset problems in integers
Abstract
Let be a set in an abelian group . For integers the generalized -fold sumset, denoted by , is the set of sums of elements of , where each element appears in the sum at most times. If lower bounds for are known, as well as the structure of the sets of integers for which is minimal. In this paper we generalize this result by giving a lower bound for when for a prime , and show new proofs for the direct and inverse problems in .
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.
