On the discretised ABC sum-product problem
Abstract
Let 0 < β ≤ α < 1 and > 0. I prove that there exists η > 0 such that the following holds for every pair of Borel sets A,B ⊂ R with H A = α and H B = β: H \c ∈ R : H (A + cB) ≤ α + η\ ≤ α - β1 - β + . This extends a result of Bourgain from 2010, which contained the case α = β. The paper also contains a δ-discretised, and somewhat stronger, version of the estimate above, and new information on the size of long sums of the form a1B + … + anB.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.