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 , regardless of Diophantine type, there is a collection of intervals in which is closed under translation, contains intervals of arbitrarily small length, and along which the discrepancy of the sequence is bounded above uniformly by a constant.
Recommendations
- Constructing bounded remainder sets and cut-and-project sets which are bounded distance to lattices
- Constructing bounded remainder sets and cut-and-project sets which are bounded distance to lattices. II.
- Weighted \(1\times 1\) cut-and-project sets in bounded distance to a lattice
- Sets of bounded discrepancy for multi-dimensional irrational rotation
- Pisot substitution sequences, one dimensional cut-and-project sets and bounded remainder sets with fractal boundary
Cites work
Cited in
(7)- Pisot substitution sequences, one dimensional cut-and-project sets and bounded remainder sets with fractal boundary
- Open problems and conjectures related to the theory of mathematical quasicrystals
- Number of bounded distance equivalence classes in hulls of repetitive Delone sets
- Gaps problems and frequencies of patches in cut and project sets
- Weighted \(1\times 1\) cut-and-project sets in bounded distance to a lattice
- Constructing bounded remainder sets and cut-and-project sets which are bounded distance to lattices
- Discrepancy bounds for \(\boldsymbol{\beta}\)-adic Halton sequences
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)