Constructing bounded remainder sets and cut-and-project sets which are bounded distance to lattices

Research output: Contribution to journalArticlepeer-review


For any irrational cut-and-project setup, we demonstrate a natural infinite family of windows which gives rise to separated nets that are each bounded distance to a lattice. Our proof provides a new construction, using a sufficient condition of Rauzy, of an infinite family of non-trivial bounded remainder sets for any totally irrational toral rotation in any dimension.

Research supported by EPSRC grants EP/J00149X/1 and EP/L001462/1.
Original languageEnglish
Pages (from-to)189-201
Number of pages13
JournalIsrael J. Math
Issue number1
Early online date7 Jan 2016
Publication statusPublished - 1 May 2016

Bibliographical note

© Hebrew University of Jerusalem 2016. This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details.

Cite this