Papers
Topics
Authors
Recent
Search
2000 character limit reached

Additive energies of subsets of discrete cubes

Published 9 Jul 2024 in math.CO and math.NT | (2407.06944v2)

Abstract: For a positive integer $n \geq 2$, define $t_n$ to be the smallest number such that the additive energy $E(A)$ of any subset $A \subset {0,1,\cdots,n-1}d$ and any $d$ is at most $|A|{t_n}$. Trivially we have $t_n \leq 3$ and $$ t_n \geq 3 - \log_n\frac{3n3}{2n3+n} $$ by considering $A = {0,1,\cdots,n-1}d$. In this note, we investigate the behavior of $t_n$ for large $n$ and obtain the following non-trivial bounds: $$ 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>0$ is an absolute constant.

Citations (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.