Additive energies of subsets of discrete cubes
Xuancheng Shao

TL;DR
This paper investigates the asymptotic behavior of the smallest exponent controlling the additive energy of subsets in discrete cubes, establishing new bounds that refine previous trivial estimates for large dimensions.
Contribution
The paper provides non-trivial bounds on the exponent $t_n$ that governs additive energy in discrete cubes, improving understanding of its asymptotic behavior as $n$ grows.
Findings
Bounds on $t_n$ for large $n$ are established.
The lower bound approaches 3 minus a logarithmic term involving $rac{3 ext{sqrt}(3)}{4}$.
The upper bound approaches 3 minus a constant logarithmic term.
Abstract
For a positive integer , define to be the smallest number such that the additive energy of any subset and any is at most . Trivially we have and by considering . In this note, we investigate the behavior of for large and obtain the following non-trivial bounds: where is an absolute constant.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Mathematical Approximation and Integration · Digital Image Processing Techniques
