Bounded remainder sets, bounded distance equivalent cut-and-project sets, and equidecomposability
Metric Geometry
2026-02-13 v2 Dynamical Systems
Abstract
We use the measurable Hall's theorem due to Cie\'sla and Sabok to prove that (i) if two measurable sets of the same measure are bounded remainder sets with respect to a given irrational -dimensional vector , then are equidecomposable with measurable pieces using translations from ; and (ii) given a lattice with projections and onto and respectively, if two cut-and-project sets in obtained from Riemann measurable windows are bounded distance equivalent, then are equidecomposable with measurable pieces using translations from . We also prove by a different method that for one-dimensional cut-and-project sets, if the windows are polytopes then the pieces can also be chosen to be polytopes; this fails in dimensions two and higher.
Cite
@article{arxiv.2511.21148,
title = {Bounded remainder sets, bounded distance equivalent cut-and-project sets, and equidecomposability},
author = {Mark Mordechai Etkind and Sigrid Grepstad and Mihail N. Kolountzakis and Nir Lev},
journal= {arXiv preprint arXiv:2511.21148},
year = {2026}
}