Equivalence classes of codimension-one cut-and-project nets

From MaRDI portal
Publication:2805060




Abstract: We prove that in any totally irrational cut-and-project setup with codimension (internal space dimension) one, it is possible to choose sections (windows) in non-trivial ways so that the resulting sets are bounded displacement to lattices. Our proof demonstrates that for any irrational alpha, regardless of Diophantine type, there is a collection of intervals in mathbbR/mathbbZ which is closed under translation, contains intervals of arbitrarily small length, and along which the discrepancy of the sequence nalpha is bounded above uniformly by a constant.









This page was built for publication: Equivalence classes of codimension-one cut-and-project nets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805060)