
TL;DR
This paper explores the relationship between set sum sizes and common energies, establishing a sharp subexponential bound and improving the arithmetic regularity lemma's parameter dependence.
Contribution
It introduces a sharp subexponential bound linking the doubling constant and minimal common energy, and provides an improved proof of the arithmetic regularity lemma.
Findings
Established a subexponential dependence between doubling constant and common energy.
Proved a version of the arithmetic regularity lemma with better parameter dependence.
Analyzed the relationship between sumset size and subset energies.
Abstract
We continue to study the relationship between the size of the sum of a set and the common energy of its subsets. We find a rather sharp subexponential dependence between the doubling constant of a set and the minimal common energy taken over all partitions of into two disjoint subsets. As an application, we give a proof of the well--known arithmetic regularity lemma with better dependence on parameters.
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.
