2000 character limit reached
Large values of the additive energy in R^d and Z^d (1308.2247v1)
Published 9 Aug 2013 in math.CO
Abstract: Combining Freiman's theorem with Balog-Szemeredi-Gowers theorem one can show that if an additive set has large additive energy, then a large piece of the set is contained in a generalized arithmetic progression of small rank and size. In this paper, we prove the above statement with the optimal bound for the rank of the progression. The proof strategy involves studying upper bounds for additive energy of subsets of Rd and Zd.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.