English

Energy estimates in sum-product and convexity problems

Combinatorics 2021-09-13 v1 Number Theory

Abstract

We prove a new class of low-energy decompositions which, amongst other consequences, imply that any finite set AA of integers may be written as A=BCA = B \cup C, where BB and CC are disjoint sets satisfying {(b1,,b2s)B2s  b1++bs=bs+1++b2s}sB2s(loglogs)1/2o(1) |\{ (b_1, \dots, b_{2s}) \in B^{2s} \ | \ b_1 + \dots + b_{s} = b_{s+1} + \dots + b_{2s}\}| \ll_{s} |B|^{2s - (\log \log s)^{1/2 - o(1)}} and {(c1,,c2s)C2s  c1cs=cs+1c2s}sC2s(loglogs)1/2o(1). |\{ (c_1, \dots, c_{2s}) \in C^{2s} \ | \ c_1 \dots c_{s} = c_{s+1} \dots c_{2s} \}| \ll_{s} |C|^{2s - (\log \log s)^{1/2 - o(1)}}. This generalises previous results of Bourgain--Chang on many-fold sumsets and product sets to the setting of many-fold energies, albeit with a weaker power saving, consequently confirming a speculation of Balog--Wooley. We further use our method to obtain new estimates for ss-fold additive energies of kk-convex sets, and these come arbitrarily close to the known lower bounds as ss becomes sufficiently large.

Keywords

Cite

@article{arxiv.2109.04932,
  title  = {Energy estimates in sum-product and convexity problems},
  author = {Akshat Mudgal},
  journal= {arXiv preprint arXiv:2109.04932},
  year   = {2021}
}

Comments

25 pages

R2 v1 2026-06-24T05:51:49.230Z