A new bound on partial sum-sets and difference-sets, and applications to the Kakeya conjecture
Nets Hawk Katz, Terence Tao
Abstract
Let A, B, be finite subsets of an abelian group, and let G ⊂ A × B be such that # A, # B, # \a+b: (a,b) ∈ G \ ≤ N. We consider the question of estimating the quantity # \a-b: (a,b) ∈ G \. Recently Bourgain improved the trivial upper bound of N2 to N2-1/13, and applied this to the Kakeya conjecture. We improve Bourgain's estimate further to N2-1/6, and obtain the further improvement of N2-1/4 if we also know that # \a+2b: (a,b) ∈ G\ ≤ N. We conclude that Besicovitch sets in n have Hausdorff dimension at least 6n/11+5/11 and Minkowski dimension at least 4n/7 + 3/7. This is new for n > 8.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell