English

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 A,BRdA,B \subset \mathbb{R}^d of the same measure are bounded remainder sets with respect to a given irrational dd-dimensional vector α\alpha, then A,BA, B are equidecomposable with measurable pieces using translations from Zα+Zd\mathbb{Z} \alpha + \mathbb{Z}^d; and (ii) given a lattice ΓRm×Rn\Gamma \subset \mathbb{R}^m \times \mathbb{R}^n with projections p1p_1 and p2p_2 onto Rm\mathbb{R}^m and Rn\mathbb{R}^n respectively, if two cut-and-project sets in Rm\mathbb{R}^m obtained from Riemann measurable windows W,WRnW, W' \subset \mathbb{R}^n are bounded distance equivalent, then W,WW, W' are equidecomposable with measurable pieces using translations from p2(Γ)p_2(\Gamma). We also prove by a different method that for one-dimensional cut-and-project sets, if the windows W,WRnW, W' \subset \mathbb{R}^n are polytopes then the pieces can also be chosen to be polytopes; this fails in dimensions two and higher.

Keywords

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}
}
R2 v1 2026-07-01T07:55:46.453Z