Energy estimates in sum-product and convexity problems
Abstract
We prove a new class of low-energy decompositions which, amongst other consequences, imply that any finite set A of integers may be written as A = B C, where B and C are disjoint sets satisfying \[ |\ (b1, …, b2s) ∈ B2s \ | \ b1 + … + bs = bs+1 + … + b2s\| s |B|2s - ( s)1/2 - o(1) \] and \[ |\ (c1, …, c2s) ∈ C2s \ | \ c1 … cs = cs+1 … c2s \| s |C|2s - ( 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 s-fold additive energies of k-convex sets, and these come arbitrarily close to the known lower bounds as s becomes sufficiently large.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.