2000 character limit reached
On sets with small additive doubling in product sets
Published 12 Feb 2015 in math.NT | (1502.03700v1)
Abstract: Following the sum-product paradigm, we prove that for a set $B$ with polynomial growth, the product set $B.B$ cannot contain large subsets with size of order $|B|2$ with small doubling. It follows that the additive energy of $B.B$ is asymptotically $o(|B|6)$. In particular, we extend to sets of small doubling and polynomial growth the classical Multiplication Table theorem of Erd\H{o}s saying that $|[1..n]. [1..n]| = o(n2)$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.