English

Additive energies of subsets of discrete cubes

Combinatorics 2024-11-20 v2 Number Theory

Abstract

For a positive integer n2n \geq 2, define tnt_n to be the smallest number such that the additive energy E(A)E(A) of any subset A{0,1,,n1}dA \subset \{0,1,\cdots,n-1\}^d and any dd is at most Atn|A|^{t_n}. Trivially we have tn3t_n \leq 3 and tn3logn3n32n3+n t_n \geq 3 - \log_n\frac{3n^3}{2n^3+n} by considering A={0,1,,n1}dA = \{0,1,\cdots,n-1\}^d. In this note, we investigate the behavior of tnt_n for large nn and obtain the following non-trivial bounds: 3(1+on(1))logn334tn3logn(1+c), 3 - (1+o_{n\rightarrow\infty}(1)) \log_n \frac{3\sqrt{3}}{4} \leq t_n \leq 3 - \log_n(1+c), where c>0c>0 is an absolute constant.

Keywords

Cite

@article{arxiv.2407.06944,
  title  = {Additive energies of subsets of discrete cubes},
  author = {Xuancheng Shao},
  journal= {arXiv preprint arXiv:2407.06944},
  year   = {2024}
}

Comments

17 pages. Referee's comments incorporated