Gaps problems and frequencies of patches in cut and project sets

ALAN HAYNES, HENNA KOIVUSALO, JAMES WALTON, LORENZO SADUN
2016 Mathematical proceedings of the Cambridge Philosophical Society (Print)  
AbstractWe 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 sizer, which depend on the precise cut and project sets being used, and which are almost always less than a power of logr. Furthermore, for a substantial collection of cut and project sets we show that the number of frequencies of patches of
more » ... ains bounded asrtends to infinity. The latter result applies to a collection of cut and project sets of full Hausdorff dimension.
doi:10.1017/s0305004116000128 fatcat:ou6yj4pilrefvosfh4pfqk5y5m