Sums of dilates over groups of prime order
David Conlon, Jeck Lim

TL;DR
This paper investigates the size of sums of dilates over prime order groups, establishing near-optimal bounds for fixed density and large dilation factors as the prime tends to infinity.
Contribution
It provides new bounds on the minimal size of sumsets of the form A + λ·A in prime groups for large λ and fixed density, advancing understanding in additive combinatorics.
Findings
Established near-optimal bounds for sumsets with large dilates
Analyzed behavior as prime p tends to infinity for fixed density
Extended previous results to new regimes of λ and density
Abstract
For prime, and , the sum of dilates is defined by \[A + \lambda \cdot A = \{a + \lambda a' : a, a' \in A\}.\] The basic problem on such sums of dilates asks for the minimum size of for given , of given density , and tending to infinity. We investigate this problem for fixed and tending to infinity, proving near-optimal bounds in this case.
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
TopicsRings, Modules, and Algebras · Finite Group Theory Research · Advanced Topics in Algebra
