On sets with small additive doubling in product sets
Dmitry Zhelezov

TL;DR
This paper proves that sets with polynomial growth cannot have large subsets with small additive doubling within their product sets, extending classical results and showing the additive energy is asymptotically small.
Contribution
It extends the classical Multiplication Table theorem to sets of small doubling and polynomial growth, revealing limitations on the structure of their product sets.
Findings
Product sets of polynomial growth cannot contain large small-doubling subsets.
Additive energy of such product sets is asymptotically smaller than |B|^6.
Generalizes Erdős's Multiplication Table theorem to broader classes of sets.
Abstract
Following the sum-product paradigm, we prove that for a set with polynomial growth, the product set cannot contain large subsets with size of order with small doubling. It follows that the additive energy of is asymptotically . In particular, we extend to sets of small doubling and polynomial growth the classical Multiplication Table theorem of Erd\H{o}s saying that .
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 · Analytic Number Theory Research · Advanced Graph Theory Research
