REVIEW 3 cited by
Control and its applications in additive combinatorics
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
We prove new quantitative bounds on the additive structure of sets obeying an $L^3$ 'control' assumption, which arises naturally in several questions within additive combinatorics. This has a number of applications - in particular we improve the known bounds for the sum-product problem, the Balog-Szemer\'{e}di-Gowers theorem, and the additive growth of convex sets.
Forward citations
Cited by 3 Pith papers
-
The Entropic Sum-Product Phenomenon
For every discrete real-valued random variable X with finite entropy, max{H(X+X'), H(XX')} ≥ (8/7)H(X) - O(log H(X)).
-
Additive structure in convex sets
Convex sets can contain Omega(|A|^{3/2}) three-term arithmetic progressions.
-
Entropic additive energy and entropy inequalities for sums and products
Introduces differential entropic additive energy and proves new entropy bounds for sums, products, and sum-product combinations, plus a counterexample limiting the entropic Erdős-Szemerédi phenomenon to exponent at most 1/3.
Discussion (0). Continue with ORCID to comment.