Local Complexity of Delone Sets and Crystallinity
From MaRDI portal
Abstract: This paper characterizes when a Delone set X is an ideal crystal in terms of restrictions on the number of its local patches of a given size or on the hetereogeneity of their distribution. Let N(T) count the number of translation-inequivalent patches of radius T in X and let M(T) be the minimum radius such that every closed ball of radius M(T) contains the center of a patch of every one of these kinds. We show that for each of these functions there is a `gap in the spectrum' of possible growth rates between being bounded and having linear growth, and that having linear growth is equivalent to X being an ideal crystal. Explicitly, for N(T), if R is the covering radius of X then either N(T) is bounded or N(T) >= T/2R for all T>0. The constant 1/2R in this bound is best possible in all dimensions. For M(T), either M(T) is bounded or M(T) >= T/3 for all T>0. Examples show that the constant 1/3 in this bound cannot be replaced by any number exceeding 1/2. We also show that every aperiodic Delone set X has M(T) >= c(n)T for all T>0, for a certain constant c(n) which depends on the dimension n of X and is greater than 1/3 when n > 1.
Recommendations
- The complexity of local dimensions for constructible sets
- Delone sets with finite local complexity: Linear repetitivity versus positivity of weights
- Lattice bounded distance equivalence for 1D Delone sets with finite local complexity
- On the origin of crystallinity: a lower bound for the regularity radius of Delone sets
- A local Vapnik-Chervonenkis complexity
- Complexity of computing the local dimension of a semialgebraic set
- scientific article; zbMATH DE number 1379305
- scientific article; zbMATH DE number 44117
- Local Density of Kleene Degrees
- Delone measures of finite local complexity and applications to spectral theory of one-dimensional continuum models of quasicrystals
Cited in
(15)- Delone sets with finite local complexity: Linear repetitivity versus positivity of weights
- Statistics of patterns in typical cut and project sets
- Pure point diffraction implies zero entropy for Delone sets with uniform cluster frequencies
- On the combinatorial characterization of quasicrystals
- Regularity of aperiodic minimal subshifts
- Two-dimensional iterated morphisms and discrete planes
- On weakly almost periodic measures
- Recurrence and Frequencies
- Local groups in Delone sets: a conjecture and results
- On the origin of crystallinity: a lower bound for the regularity radius of Delone sets
- Maximal pattern complexity of two-dimensional words
- A classification of aperiodic order via spectral metrics and Jarník sets
- The cohomological equation over dynamical systems arising from Delone sets
- Stationary processes and pure point diffraction
- A note on entropy of Delone sets
This page was built for publication: Local Complexity of Delone Sets and Crystallinity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796567)