Bounded remainder sets, bounded distance equivalent cut-and-project sets, and equidecomposability

Read full text
Authors: Mark Mordechai Etkind, Sigrid Grepstad, Mihail N. Kolountzakis, Nir Lev
Cited by: 0

Abstract

Abstract We use the measurable Hall’s theorem due to Cieśla and Sabok to prove that (i) if two measurable sets $A,B \subset \mathbb{R}^{d}$ of the same measure are bounded remainder sets with respect to a totally irrational $d$-dimensional vector $\alpha $, then $A, B$ are equidecomposable with measurable pieces using translations from $\mathbb{Z} \alpha + \mathbb{Z}^{d}$; and (ii) given a lattice $\Gamma \subset \mathbb{R}^{m} \times \mathbb{R}^{n}$ with projections $p_{1}$ and $p_{2}$ onto $\mathbb{R}^{m}$ and $\mathbb{R}^{n}$, respectively, if two cut-and-project sets in $\mathbb{R}^{m}$ obtained from Riemann measurable windows $W, W^{\prime} \subset \mathbb{R}^{n}$ are bounded distance equivalent, then $W, W^{\prime}$ are equidecomposable with measurable pieces using translations from $p_{2}(\Gamma )$. We also prove by a different method that for one-dimensional cut-and-project sets, if the windows $W, W^{\prime} \subset \mathbb{R}^{n}$ are polytopes then the pieces can also be chosen to be polytopes; however, this result fails in dimensions two and higher.

Fields of Study & Subjects

Computational Geometry and Mesh Generation Point processes and geometric inequalities Mathematical Approximation and Integration

Publication details

Journal / source
International Mathematics Research Notices
Volume
2026
Issue
14
Publication date
1 July 2026
Language
EN