Hostname: page-component-6898cfcb55-w5hgh Total loading time: 0 Render date: 2026-11-11T05:32:33.476Z Has data issue: false hasContentIssue false

Tower systems for linearly repetitive Delone sets

Published online by Cambridge University Press:  23 November 2010

JOSÉ ALISTE-PRIETO
Affiliation:
Centro de Modelamiento Matemático, Universidad de Chile, Blanco Encalada 2120, 7to. piso. Santiago, Chile (email: jaliste@dim.uchile.cl)
DANIEL CORONEL
Affiliation:
Facultad de Matemáticas, Pontificia Universidad Católica de Chile, Avenida Vicuña Mackenna 4860, Santiago, Chile (email: acoronel@mat.puc.cl)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2010