pith. sign in

arxiv: 2506.19114 · v4 · pith:DWSZJJXJnew · submitted 2025-06-23 · 🧮 math.MG · cs.DM· math.FA

Fast repetitivity in non-rectifiable Delone sets

classification 🧮 math.MG cs.DMmath.FA
keywords delonesetsnon-rectifiablerepetitivityburagocloseconstructiondensity
0
0 comments X
read the original abstract

We present a construction of non-rectifiable, repetitive Delone sets in every Euclidean space $\mathbb{R}^d$ with $d \geq 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.