Statistics of patterns in typical cut and project sets
classification
🧮 math.DS
math.NT
keywords
giveprojectsetsstatisticstypicalappearancesarticleasymptotic
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.