Finite trees inside thin subsets of Rd
Abstract
Bennett, Iosevich and Taylor proved that compact subsets of Rd, d 2, of Hausdorff dimensions greater than d+12 contain chains of arbitrary length with gaps in a non-trivial interval. In this paper we generalize this result to arbitrary tree configurations.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.