Fast repetitivity in non-rectifiable Delone sets
Abstract
We present a construction of non-rectifiable, repetitive Delone sets in every Euclidean space Rd with d ≥ 2. We further obtain a close to optimal repetitivity function for such sets. The proof is based on the process of encoding a non-realisable density in a Delone set, due to Burago and Kleiner.
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.