Hostname: page-component-6898cfcb55-cbk24 Total loading time: 0 Render date: 2026-11-11T21:59:19.047Z Has data issue: false hasContentIssue false

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

Published online by Cambridge University Press:  11 November 2014

ALAN HAYNES*
Affiliation:
Department of Mathematics, University of York, UK email alan.haynes@york.ac.uk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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 equivalent to lattices. Our proof demonstrates that for any irrational ${\it\alpha}$, regardless of Diophantine type, there is a collection of intervals in $\mathbb{R}/\mathbb{Z}$ which is closed under translation, contains intervals of arbitrarily small length, and along which the discrepancy of the sequence $\{n{\it\alpha}\}$ is bounded above uniformly by a constant.

Information

Type
Research Article
Copyright
© Cambridge University Press, 2014