Hostname: page-component-74656f9884-8r8nv Total loading time: 0 Render date: 2026-11-08T06:03:37.526Z Has data issue: false hasContentIssue false

Cut and project sets with polytopal window I: Complexity

Published online by Cambridge University Press:  20 February 2020

HENNA KOIVUSALO
Affiliation:
Faculty of Mathematics, University of Vienna, Oskar-Morgenstern-platz 1, 1090 Wien, Austria email henna.koivusalo@univie.ac.at
JAMES J. WALTON
Affiliation:
School of Mathematics and Statistics, University of Glasgow, University Place, Glasgow, G12 8QQ, UK email Jamie.Walton@glasgow.ac.uk
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.

We calculate the growth rate of the complexity function for polytopal cut and project sets. This generalizes work of Julien where the almost canonical condition is assumed. The analysis of polytopal cut and project sets has often relied on being able to replace acceptance domains of patterns by so-called cut regions. Our results correct mistakes in the literature where these two notions are incorrectly identified. One may only relate acceptance domains and cut regions when additional conditions on the cut and project set hold. We find a natural condition, called the quasicanonical condition, guaranteeing this property and demonstrate by counterexample that the almost canonical condition is not sufficient for this. We also discuss the relevance of this condition for the current techniques used to study the algebraic topology of polytopal cut and project sets.

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s) 2020