Power Laws for the Favard Length Problem in Rd
Abstract
We prove a power law for the asymptotic decay of the Favard length of neighbourhoods of certain self-similar sets in Rd with d ≥ 2. These self-similar sets are generalizations of the so-called four-corner Cantor set to higher dimensions, as well as to a more general class of rational digit sets. When d ≥ 3, our estimates are the first such non-trivial asymptotic upper bounds for the Favard length problem. The extension to a new class of digit sets (which is new even when d = 2, but holds for d ≥ 2 generally) uses the work of G. Kiss, I. Laba, G. Somlai and the author on vanishing sums of roots of unity and divisibility by many cyclotomic polynomials.
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.