Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 26 Nov 2025 in math.MG and math.DS | (2511.21148v1)

Abstract: We use the measurable Hall's theorem due to Cieśla and Sabok to prove that (i) if two measurable sets A,BR<sup>dA,B \subset \mathbb{R}<sup>d of the same measure are bounded remainder sets with respect to a given irrational dd-dimensional vector αα, then A,BA, B are equidecomposable with measurable pieces using translations from Zα+Z<sup>d\mathbb{Z} α+ \mathbb{Z}<sup>d; and (ii) given a lattice ΓR<sup>m</sup>×R<sup>nΓ\subset \mathbb{R}<sup>m</sup> \times \mathbb{R}<sup>n with projections p1p_1 and p2p_2 onto R<sup>m\mathbb{R}<sup>m and R<sup>n\mathbb{R}<sup>n respectively, if two cut-and-project sets in R<sup>m\mathbb{R}<sup>m obtained from Riemann measurable windows $W, W&#39; \subset \mathbb{R}<sup>n$ are bounded distance equivalent, then $W, W&#39;$ are equidecomposable with measurable pieces using translations from p2(Γ)p_2(Γ). We also prove by a different method that for one-dimensional cut-and-project sets the pieces can be chosen Riemann measurable.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.