An improved bound for the Minkowski dimension of Besicovitch sets in medium dimension
Abstract
We use geometrical combinatorics arguments, including the ``hairbrush'' and x-ray arguments of Wolff and the sticky/plany/grainy analysis of Katz, Laba, and Tao, to show that Besicovitch sets in Rn have Minkowski dimension at least (n+2)/2 + n for all n > 3, where n > 0 is an absolute constant depending only on n. This complements the results of Katz, Laba, and Tao, which established the same result for n=3, and of Bourgain and Katz-Tao, arithmetic combinatorics techniques to establish the result for n > 8. In contrast to previous work, our arguments will be purely geometric and do not require arithmetic combinatorics.
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.