2000 character limit reached
Statistics of patterns in typical cut and project sets
Published 14 Feb 2017 in math.DS and math.NT | (1702.04041v1)
Abstract: In this article pattern statistics of typical cubical cut and project sets are studied. We give estimates for the rate of convergence of appearances of patches to their asymptotic frequencies. We also give bounds for repetitivity and repulsivity functions. The proofs use ideas and tools developed in discrepancy theory.
Paper Prompts
Sign up for free to create and run prompts on this paper.