Interior of distance trees over thin Cantor sets
Abstract
It is known that if a compact set E in Rd has Hausdorff dimension greater than (d+1)/2, then its n-chain distance set n(E) = \(|x1-x2|,·s, |xn- xn+1|)∈ Rn: xi ∈ E, xi≠ xj for i≠ j \ has nonempty interior for any n∈ N. In this paper, we prove that for every Cantor set K⊂ Rd and for every n∈N, there exists K⊂ Rd such that the pinned n-chain distance set of K× K⊂ R2d has nonempty interior, and hence, that n(K× K) has nonempty interior. Our results do not depend on the Newhouse gap lemma but rather on the containment lemma recently introduced by Jung and Lai. Our results generalize three-fold: to arbitrary finite trees, to higher dimensions, and to maps that have non-vanishing partials. As an application, we provide a class of examples of Cantor sets E⊂ R2d so that for any s≥ d, H(E)= s and xn(E)≠ for some x∈ E.
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.