A combinatorial proof of a sumset conjecture of Furstenberg
arXiv:2107.10605 · doi:10.1007/s00493-023-00008-9
Abstract
We give a new proof of a sumset conjecture of Furstenberg that was first proved by Hochman and Shmerkin in 2012: if is irrational and and are - and -invariant subsets of , respectively, then . Our main result yields information on the size of the sumset uniformly across a compact set of parameters at fixed scales. The proof is combinatorial and avoids the machinery of local entropy averages and CP-processes, relying instead on a quantitative, discrete Marstrand projection theorem and a subtree regularity theorem that may be of independent interest.
arXiv comment26 pages. Some of this work was originally posted to the arXiv in the first half of the paper "Additive transversality of fractal sets in the reals and the integers" (arXiv:2007.05480v1); that paper has since been updated (arXiv:2007.05480) and no longer includes any of this work
References in corpus (9)
- Some connections between Falconer's distance set conjecture, and sets of Furstenburg type
- Local entropy averages and projections of fractal measures
- On restricted families of projections in R^3
- On the Packing Dimension and Category of Exceptional Sets of Orthogonal Projections
- Marstrand-type theorems for the counting and mass dimensions in
- A Marstrand theorem for subsets of integers
- A combinatorial proof of Marstrand's Theorem for products of regular Cantor sets
- Digit expansions of numbers in different bases
- Additive and geometric transversality of fractal sets in the integers