Fast repetitivity in non-rectifiable Delone sets
Abstract
We present a construction of non-rectifiable, repetitive Delone sets in every Euclidean space R d 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.
Fields of Study & Subjects
Handwritten Text Recognition Techniques
Publication details
- Journal / source
- Journal of Mathematical Analysis and Applications
- Volume
- 565
- Issue
- 2
- Pages
- 130962–130962
- Publication date
- 17 July 2026
- Language
- EN