Classification of rank-one actions via the cutting-and-stacking parameters
Let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper G"> <mml:semantics> <mml:mi>G</mml:mi> <mml:annotation encoding="application/x-tex">G</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be a discrete countable infinite group. Let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper T"> <mml:semantics> <mml:mi>T</mml:mi> <mml:annotation encoding="application/x-tex">T</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper T overTilde"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mover> <mml:mi>T</mml:mi> <mml:mo> ~ </mml:mo> </mml:mover> </mml:mrow> <mml:annotation encoding="application/x-tex">\widetilde T</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be two rank-one <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="sigma"> <mml:semantics> <mml:mi> σ </mml:mi> <mml:annotation encoding="application/x-tex">\sigma</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -finite measure preserving actions of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper G"> <mml:semantics> <mml:mi>G</mml:mi> <mml:annotation encoding="application/x-tex">G</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and let <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper T"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">T</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathcal {T}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper T overTilde"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mover> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">T</mml:mi> </mml:mrow> <mml:mo> ~ </mml:mo> </mml:mover> </mml:mrow> <mml:annotation encoding="application/x-tex">\widetilde {\mathcal {T}}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> be the cutting-and-stacking parameters that determine <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper T"> <mml:semantics> <mml:mi>T</mml:mi> <mml:annotation encoding="application/x-tex">T</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper T overTilde"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mover> <mml:mi>T</mml:mi> <mml:mo> ~ </mml:mo> </mml:mover> </mml:mrow> <mml:annotation encoding="application/x-tex">\widetilde T</mml:annotation> </mml:semantics> </mml:math> </inline-formula> respectively. We find necessary and sufficient conditions on <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper T"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">T</mml:mi> </mml:mrow> <mml:annotation encoding="application/x-tex">\mathcal {T}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper T overTilde"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mover> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mi class="MJX-tex-caligraphic" mathvariant="script">T</mml:mi> </mml:mrow> <mml:mo> ~ </mml:mo> </mml:mover> </mml:mrow> <mml:annotation encoding="application/x-tex">\widetilde {\mathcal {T}}</mml:annotation> </mml:semantics> </mml:math> </inline-formula> under which <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper T"> <mml:semantics> <mml:mi>T</mml:mi> <mml:annotation encoding="application/x-tex">T</mml:annotation> </mml:semantics> </mml:math> </inline-formula> and <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper T overTilde"> <mml:semantics> <mml:mrow class="MJX-TeXAtom-ORD"> <mml:mover> <mml:mi>T</mml:mi> <mml:mo> ~ </mml:mo> </mml:mover> </mml:mrow> <mml:annotation encoding="application/x-tex">\widetilde T</mml:annotation> </mml:semantics> </mml:math> </inline-formula> are isomorphic. We also show that the isomorphism equivalence relation is a <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="upper G Subscript delta"> <mml:semantics> <mml:msub> <mml:mi>G</mml:mi> <mml:mi> δ </mml:mi> </mml:msub> <mml:annotation encoding="application/x-tex">G_\delta</mml:annotation> </mml:semantics> </mml:math> </inline-formula> -subset in the Cartesian square of the set of all admissible parameters <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="script upper T"> <mml:semantics>
Authors
- Alexandre I. Danilenko (ORCID: https://orcid.org/0000-0002-3198-9013)
- Mykyta I. Vieprik
Publication Details
- Journal
- Transactions of the American Mathematical Society
- Published
- 2026-04-16
- DOI
- https://doi.org/10.1090/tran/9682
- Primary Topic
- Advanced Topology and Set Theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Polska Akademia Nauk
- National Academy of Sciences