2000 character limit reached
On additive bases of sets with small product set
Published 7 Jun 2016 in math.NT | (1606.02320v3)
Abstract: We prove that finite sets of real numbers satisfying $|AA| \leq |A|{1+\epsilon}$ with sufficiently small $\epsilon > 0$ cannot have small additive bases nor can they be written as a set of sums $B+C$ with $|B|, |C| \geq 2$. The result can be seen as a real analog of the conjecture of S\'ark\"ozy that multiplicative subgroups of finite fields of prime order are additively irreducible.
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.