31 research outputs found

    Measurable realizations of abstract systems of congruences

    Get PDF
    An abstract system of congruences describes a way of partitioning a space into finitely many pieces satisfying certain congruence relations. Examples of abstract systems of congruences include paradoxical decompositions and nn-divisibility of actions. We consider the general question of when there are realizations of abstract systems of congruences satisfying various measurability constraints. We completely characterize which abstract systems of congruences can be realized by nonmeager Baire measurable pieces of the sphere under the action of rotations on the 22-sphere. This answers a question of Wagon. We also construct Borel realizations of abstract systems of congruences for the action of PSL2(Z)\mathsf{PSL}_2(\mathbb{Z}) on P1(R)\mathsf{P}^1(\mathbb{R}). The combinatorial underpinnings of our proof are certain types of decomposition of Borel graphs into paths. We also use these decompositions to obtain some results about measurable unfriendly colorings.Comment: minor correction

    Folner tilings for actions of amenable groups

    Full text link
    We show that every probability-measure-preserving action of a countable amenable group G can be tiled, modulo a null set, using finitely many finite subsets of G ("shapes") with prescribed approximate invariance so that the collection of tiling centers for each shape is Borel. This is a dynamical version of the Downarowicz--Huczek--Zhang tiling theorem for countable amenable groups and strengthens the Ornstein--Weiss Rokhlin lemma. As an application we prove that, for every countably infinite amenable group G, the crossed product of a generic free minimal action of G on the Cantor set is Z-stable.Comment: Minor revisions. Final versio

    Ultraproducts of measure preserving actions and graph combinatorics

    Get PDF
    Ultraproducts of measure preserving actions of countable groups are used to study the graph combinatorics associated with such actions, including chromatic, independence and matching numbers. Applications are also given to the theory of random colorings of Cayley graphs and sofic actions and equivalence relations
    corecore