Additive energies of subsets of discrete cubes
Abstract
For a positive integer n ≥ 2, define tn to be the smallest number such that the additive energy E(A) of any subset A ⊂ \0,1,·s,n-1\d and any d is at most |A|tn. Trivially we have tn ≤ 3 and tn ≥ 3 - n3n32n3+n by considering A = \0,1,·s,n-1\d. In this note, we investigate the behavior of tn for large n and obtain the following non-trivial bounds: 3 - (1+on→∞(1)) n 334 ≤ tn ≤ 3 - n(1+c), where c>0 is an absolute constant.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.