Bounded remainder sets, bounded distance equivalent cut-and-project sets, and equidecomposability
Abstract
We use the measurable Hall's theorem due to Cieśla and Sabok to prove that (i) if two measurable sets A,B ⊂ Rd of the same measure are bounded remainder sets with respect to a totally irrational d-dimensional vector α, then A, B are equidecomposable with measurable pieces using translations from Z α+ Zd; and (ii) given a lattice Γ⊂ Rm × Rn with projections p1 and p2 onto Rm and Rn respectively, if two cut-and-project sets in Rm obtained from Riemann measurable windows W, W' ⊂ Rn are bounded distance equivalent, then W, W' are equidecomposable with measurable pieces using translations from p2(Γ). We also prove by a different method that for one-dimensional cut-and-project sets, if the windows W, W' ⊂ Rn are polytopes then the pieces can also be chosen to be polytopes; however this result fails in dimensions two and higher.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.