Tower systems for linearly repetitive Delone sets

From MaRDI portal
Publication:2884089




Abstract: In this paper we study linearly repetitive Delone sets and prove, following the work of Bellissard, Benedetti and Gambaudo, that the hull of a linearly repetitive Delone set admits a properly nested sequence of box decompositions (tower system) with strictly positive and uniformly bounded (in size and norm) transition matrices. This generalizes a result of Durand for linearly recurrent symbolic systems. Furthermore, we apply this result to give a new proof of a classic estimation of Lagarias and Pleasants on the rate of convergence of patch-frequencies.



Cites work







This page was built for publication: Tower systems for linearly repetitive Delone sets

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