Cut and project sets with polytopal window. II: Linear repetitivity
From MaRDI portal
Publication:5082385
Abstract: This paper gives a complete classification of linear repetitivity (LR) for a natural class of aperiodic Euclidean cut and project schemes with convex polytopal windows. Our results cover those cut and project schemes for which the lattice projects densely into the internal space and (possibly after translation) hits each supporting hyperplane of the polytopal window. Our main result is that LR is satisfied if and only if the patterns are of low complexity (property C), and the projected lattice satisfies a Diophantine condition (property D). Property C can be checked by computation of the ranks and dimensions of linear spans of the stabiliser subgroups of the supporting hyperplanes, as investigated in Part I to this article. To define the correct Diophantine condition D, we establish new results on decomposing polytopal cut and project schemes to factors, developing concepts initiated in the work of Forrest, Hunton and Kellendonk. This means that, when C is satisfied, the window splits into components which induce a compatible splitting of the lattice. Then property D is the requirement that, for any suitable decomposition, these factors do not project close to the origin in the internal space, relative to the norm in the total space. On each factor, this corresponds to the usual notion from Diophantine Approximation of a system of linear forms being badly approximable. This extends previous work on cubical cut and project schemes to a very general class of cut and project schemes. We demonstrate our main theorem on several examples, and derive some further consequences of our main theorem, such as the equivalence LR, positivity of weights and satisfying a subadditive ergodic theorem for this class of polytopal cut and project sets.
Recommendations
Cites work
- scientific article; zbMATH DE number 3125787 (Why is no real title available?)
- scientific article; zbMATH DE number 3867362 (Why is no real title available?)
- scientific article; zbMATH DE number 3968590 (Why is no real title available?)
- A characterization of linearly repetitive cut and project sets
- Aperiodic order. Volume 1. A mathematical invitation
- Badly approximable systems of affine forms
- Brun expansions of stepped surfaces
- Coincidence for substitutions of Pisot type
- Complexity and cohomology for cut-and-projection tilings
- Cut and project sets with polytopal window. I: Complexity
- Delone sets with finite local complexity: Linear repetitivity versus positivity of weights
- Generalized model sets and dynamical systems
- On the Pisot substitution conjecture
- On the dynamics of \mathbb{G} -solenoids. Applications to Delone sets
- PLANAR PATTERNS WITH FIVEFOLD SYMMETRY AS SECTIONS OF PERIODIC STRUCTURES IN 4-SPACE
- Pentaplexity. A class of non-periodic tilings of the plane
- Pure point dynamical and diffraction spectra
- Repetitive Delone sets and quasicrystals
- Symbolic Dynamics
- The Pisot conjecture for \(\beta\)-substitutions
- The \(S\)-adic Pisot conjecture on two letters
- The shrinking target property of irrational rotations
- Topological invariants for projection method patterns
- Transverse Laplacians for substitution tilings
- Two-symbol Pisot substitutions have pure discrete spectrum
- Weak local rules for planar octagonal tilings
Cited in
(9)- A characterization of linearly repetitive cut and project sets
- A characterisation of linear repetitivity for cut and project sets with general polytopal windows
- Discrepancy and rectifiability of almost linearly repetitive Delone sets
- Model sets with positive entropy in Euclidean cut and project schemes
- Perfectly ordered quasicrystals and the Littlewood conjecture
- Cut-and-project graphs and other complexes
- Statistics of patterns in typical cut and project sets
- Gaps problems and frequencies of patches in cut and project sets
- Cut and project sets with polytopal window. I: Complexity
This page was built for publication: Cut and project sets with polytopal window. II: Linear repetitivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5082385)
