Restricted sums of sets of cardinality $2p + 1$ in $\mathbb{Z}_p^2$
Jacinda Terkel

TL;DR
This paper proves a lower bound on the size of the restricted sumset of a set with size 2p+1 in a0a0p^2, advancing the understanding of sumset cardinalities in finite abelian groups.
Contribution
It establishes the first significant lower bound for the restricted sumset of such sets in over twenty years, addressing a variant of the Erdf6s-Heilbronn problem.
Findings
The restricted sumset has size at least 4p.
First progress in over two decades on this problem.
Provides new bounds for sumsets in a0a0p^2.
Abstract
Let be a set of size for prime . In this paper, we prove that has cardinality at least . This result is the first advancement in over two decades on a variant of the Erd\H{o}s-Heilbronn problem studied by Eliahou and Kervaire.
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
