Complexity and cohomology for cut-and-projection tilings
Complexity and cohomology for cut-and-projection tilings
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 α . …