Gaps problems and frequencies of patches in cut and project sets

Abstract

We establish a connection between gaps problems in Diophantine approximation and the frequency spectrum of patches in cut and project sets with special windows. Our theorems provide bounds for the number of distinct frequencies of patches of size r, which depend on the precise cut and project sets being used, and which are almost always less than a power of log r. Furthermore, for a substantial collection of cut and project sets we show that the number of frequencies of patches of size r remains bounded as r tends to infinity. The latter result applies to a collection of cut and project sets of full Hausdorff dimension.

27 pages, 4 figures

References in corpus (1)

• Equivalence relations on separated nets arising from linear toral flows

Cited by in corpus (6)

• Schmidt games and Cantor winning sets
• A growth model based on the arithmetic $Z$-game
• Canonical projection tilings defined by patterns
• The three gap theorem and the space of lattices
• Cut and project sets with polytopal window I: complexity
• Linear repetitivity and subadditive ergodic theorems for cut and project sets