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 of integers may be written as , where and are disjoint sets satisfying and 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 -fold additive energies of -convex sets, and these come arbitrarily close to the known lower bounds as 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