Complexity and cohomology for cut and projection tilings
Preprint
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 \alpha in terms of the ranks of certain groups which appear in the construction. We give bounds for \alpha. 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 \Q. We show that such a link cannot be established for more general tilings, and we present a counter-example in dimension one.Keywords
All Related Versions
This publication has 7 references indexed in Scilit:
- Tiling spaces are inverse limitsJournal of Mathematical Physics, 2003
- Topological invariants for projection method patternsMemoirs of the American Mathematical Society, 2002
- 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