Bounded distance equivalence of cut-and-project sets and equidecomposability
Sigrid Grepstad

TL;DR
This paper characterizes when cut-and-project sets are bounded distance equivalent, showing it depends on the equidecomposability of the windows used, and describes the classes of such equivalence in quasicrystal hulls.
Contribution
It establishes a precise criterion linking bounded distance equivalence of cut-and-project sets to the equidecomposability of their defining windows.
Findings
Bounded distance equivalence depends on window equidecomposability.
Explicit description of equivalence classes in quasicrystal hulls.
Provides conditions for when different cut-and-project sets are bounded distance equivalent.
Abstract
We show that given a lattice , and projections and onto and respectively, cut-and-project sets obtained using Jordan measurable windows and in of equal measure are bounded distance equivalent only if and are equidecomposable by translations in . As a consequence, we obtain an explicit description of the bounded distance equivalence classes in the hulls of simple quasicrystals. A corrigendum is appended at the end of the paper.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Advanced Graph Theory Research · semigroups and automata theory
