Complexity and cohomology for cut-and-projection tilings
- 23 June 2009
- journal article
- research article
- Published by Cambridge University Press (CUP) in Ergodic Theory and Dynamical Systems
- Vol. 30 (2) , 489-523
Abstract
We consider a subclass of tilings: the tilings obtained by cut-and-projection. Under somewhat standard assumptions, we show that the natural complexity function has polynomial growth. We compute its exponentαin terms of the ranks of certain groups which appear in the construction. We give bounds forα. These computations apply to some well-known tilings, such as the octagonal tilings, or tilings associated with billiard sequences. A link is made between the exponent of the complexity, and the fact that the cohomology of the associated tiling space is finitely generated over ℚ. We show that such a link cannot be established for more general tilings, and we present a counterexample in dimension one.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Complexity of cutting words on regular tilingsEuropean Journal of Combinatorics, 2005
- Tiling spaces are inverse limitsJournal of Mathematical Physics, 2003
- Repetitive Delone sets and quasicrystalsErgodic Theory and Dynamical Systems, 2003
- Topological invariants for projection method patternsMemoirs of the American Mathematical Society, 2002
- Tilings and rotations on the torus: a two-dimensional generalization of Sturmian sequencesDiscrete Mathematics, 2000
- Local configurations in a discrete planeBulletin of the Belgian Mathematical Society - Simon Stevin, 1999
- Topological invariants for substitution tilings and their associated $C^\ast$-algebrasErgodic Theory and Dynamical Systems, 1998
- Complexity of trajectories in rectangular billiardsCommunications in Mathematical Physics, 1995
- Complexity of sequences defined by billiard in the cubeBulletin de la Société Mathématiques de France, 1994
- A geometrical approach of quasiperiodic tilingsCommunications in Mathematical Physics, 1988