1,322 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

    On the Complexity of Nondeterministically Testable Hypergraph Parameters

    Get PDF
    The paper proves the equivalence of the notions of nondeterministic and deterministic parameter testing for uniform dense hypergraphs of arbitrary order. It generalizes the result previously known only for the case of simple graphs. By a similar method we establish also the equivalence between nondeterministic and deterministic hypergraph property testing, answering the open problem in the area. We introduce a new notion of a cut norm for hypergraphs of higher order, and employ regularity techniques combined with the ultralimit method.Comment: 33 page

    Perfect Matchings as IID Factors on Non-Amenable Groups

    Get PDF
    We prove that in every bipartite Cayley graph of every non-amenable group, there is a perfect matching that is obtained as a factor of independent uniform random variables. We also discuss expansion properties of factors and improve the Hoffman spectral bound on independence number of finite graphs.Comment: 16 pages; corrected missing reference in v
    • …
    corecore