A characterisation of linear repetitivity for cut and project sets with general polytopal windows

arXiv2301.06997MaRDI QIDQ6508463FDOQ6508463

Abstract: The cut and project method is a central construction in the theory of Aperiodic Order for generating quasicrystals with pure point diffraction. Linear repetitivity (LR) is a form of ideal regularity of aperiodic patterns. Recently, Koivusalo and the present author characterised LR for cut and project sets with convex polytopal windows whose supporting hyperplanes are commensurate with the lattice, the weak homogeneity property. For such cut and project sets, LR is equivalent to properties C and D, of low complexity and the scheme being Diophantine (or `badly approximable') i.e., lattice points in the total space stay far from the physical space, relative to their norm. We review then extend these results to non-convex and disconnected polytopal windows, as well as windows with polytopal partitions producing cut and project sets of labelled points. Moreover, we obtain a complete characterisation of LR in the fully general case, where weak homogeneity is not assumed. Here, the Diophantine property must be replaced with an inhomogeneous analogue.

Mathematics Subject Classification ID

Inhomogeneous linear forms (11J20) Combinatorial complexity of geometric structures (52C45) Quasicrystals and aperiodic tilings in discrete geometry (52C23)

This page was built for publication: A characterisation of linear repetitivity for cut and project sets with general polytopal windows

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6508463)