1,997 research outputs found
Baire measurable paradoxical decompositions via matchings
We show that every locally finite bipartite Borel graph satisfying a
strengthening of Hall's condition has a Borel perfect matching on some comeager
invariant Borel set. We apply this to show that if a group acting by Borel
automorphisms on a Polish space has a paradoxical decomposition, then it admits
a paradoxical decomposition using pieces having the Baire property. This
strengthens a theorem of Dougherty and Foreman who showed that there is a
paradoxical decomposition of the unit ball in using Baire
measurable pieces. We also obtain a Baire category solution to the dynamical
von Neumann-Day problem: if is a nonamenable action of a group on a Polish
space by Borel automorphisms, then there is a free Baire measurable action
of on which is Lipschitz with respect to .Comment: Minor revision
Martin's conjecture, arithmetic equivalence, and countable Borel equivalence relations
There is a fascinating interplay and overlap between recursion theory and
descriptive set theory. A particularly beautiful source of such interaction has
been Martin's conjecture on Turing invariant functions. This longstanding open
problem in recursion theory has connected to many problems in descriptive set
theory, particularly in the theory of countable Borel equivalence relations.
In this paper, we shall give an overview of some work that has been done on
Martin's conjecture, and applications that it has had in descriptive set
theory. We will present a long unpublished result of Slaman and Steel that
arithmetic equivalence is a universal countable Borel equivalence relation.
This theorem has interesting corollaries for the theory of universal countable
Borel equivalence relations in general. We end with some open problems, and
directions for future research.Comment: Corrected typo
Scott Ranks of Classifications of the Admissibility Equivalence Relation
Let be a recursive language. Let be the set of
-structures with domain . Let be a function with the property that
for all , if and only if
. Then there is some
so that
- …