Cut and project sets with polytopal window. II: Linear repetitivity

DOI10.1090/TRAN/8633zbMATH Open1491.52017arXiv2012.00591OpenAlexW3109960201MaRDI QIDQ5082385FDOQ5082385

James J. Walton, Henna Koivusalo

Publication date: 16 June 2022

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/2012.00591

Recommendations

• A characterization of linearly repetitive cut and project sets
• Cut and project sets with polytopal window. I: Complexity
• Perfectly ordered quasicrystals and the Littlewood conjecture
• Statistics of patterns in typical cut and project sets
• Linearly repetitive Delone sets

zbMATH Keywords

Diophantine approximationmodel setsaperiodic ordercut and project setslinear repetitivity

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorial complexity of geometric structures (52C45) Quasicrystals and aperiodic tilings in discrete geometry (52C23)

Cites Work

• Title not available (Why is that?)
• Coincidence for substitutions of Pisot type
• Two-symbol Pisot substitutions have pure discrete spectrum
• On the Pisot Substitution Conjecture
• Aperiodic order. Volume 1. A mathematical invitation
• Brun expansions of stepped surfaces
• Pure point dynamical and diffraction spectra
• Generalized model sets and dynamical systems
• The \(S\)-adic Pisot conjecture on two letters
• Topological invariants for projection method patterns
• Title not available (Why is that?)
• The Pisot conjecture for -substitutions
• Pentaplexity. A class of non-periodic tilings of the plane
• Title not available (Why is that?)
• Repetitive Delone sets and quasicrystals
• Complexity and cohomology for cut-and-projection tilings
• A characterization of linearly repetitive cut and project sets
• Delone sets with finite local complexity: Linear repetitivity versus positivity of weights
• The shrinking target property of irrational rotations
• On the dynamics of \mathbb{G} -solenoids. Applications to Delone sets
• PLANAR PATTERNS WITH FIVEFOLD SYMMETRY AS SECTIONS OF PERIODIC STRUCTURES IN 4-SPACE
• Symbolic Dynamics
• Transverse Laplacians for substitution tilings
• Badly approximable systems of affine forms
• Weak local rules for planar octagonal tilings
• Cut and project sets with polytopal window I: Complexity

Cited In (2)

• Discrepancy and rectifiability of almost linearly repetitive Delone sets
• A characterisation of linear repetitivity for cut and project sets with general polytopal windows

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)