Related papers: Borel graphable equivalence relations

We define some coding of Borel sets in admissible sets. Using this we generalize certain results from model theory involving admissible sets to the case of continuous actions of closed permutation groups on Polish spaces. In particular we…

We demonstrate that a reproducing kernel Hilbert or Banach space of functions on a separable absolute Borel space or an analytic subset of a Polish space is separable if it possesses a Borel measurable feature map.

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

For $N \geq 2$, we study the structure of definable abelian group extensions of the additive group $(\mathbb{R}^N,+)$ by countable abelian (Borel) groups $G$. Given an extension $H$ of $(\mathbb{R}^N,+)$ by $G$, we measure the definability…

We give the first examples of nonabelian left-orderable groups such that the conjugacy orbit equivalence relation on its space of orders has infinity orbits, yet it is smooth in the Borel sense. The examples are all nilpotent groups and we…

Following Davies, Elekes and Keleti, we study measured sets, i.e. Borel sets $B$ in $\mathbb{R}$ (or in a Polish group) for which there is a translation invariant Borel measure assigning positive and \sigma-finite measure to $B$. We…

We study probability-measure preserving (p.m.p.) actions of finitely generated groups via the graphings they define. We introduce and study the notion of isometric orbit equivalence for p.m.p. actions: two p.m.p. actions are isometric orbit…

We say that two classes of topological spaces are equivalent if each member of one class has a homeomorphic copy in the other class and vice versa. Usually when the Borel complexity of a class of metrizable compacta is considered, the class…

Every better quasi-order codifies a Borel graph that does not contain a copy of the shift graph. It is known that there is a better quasi-order that codes a Borel graph with infinite Borel chromatic number, though one has yet to be…

We show that if $E$ is a countable Borel equivalence relation on $\mathbb{R}^n$, then there is a closed subset $A \subset [0,1]^n$ of Hausdorff dimension $n$ so that $E \restriction A$ is smooth. More generally, if $\leq_Q$ is a locally…

We construct, for each countable ordinal $\xi$, a closed graph with Borel chromatic number two and Baire class $\xi$ chromatic number $\aleph\_0$.

We show that a {\it Borel} action of a Polish group on a standard Borel space is Borel isomorphic to a {\it continuous} action of the group on a Polish space, and we apply this result to three aspects of the theory of Borel actions of…

We bound the Borel cardinality of the isomorphism relation for nuclear simple separable C*-algebras: It is turbulent, yet Borel reducible to the action of the automorphism group of the Cuntz algebra O_2 on its closed subsets. The same…

In this work we study the uncountable Borel chromatic numbers, defined by Geschke (2011) as cardinal characteristics of the continuum, of low complexity graphs. We show that a strong form of locally countable graphs with compact totally…

We establish a dichotomy theorem characterizing the circumstances under which a treeable Borel equivalence relation E is essentially countable. Under additional topological assumptions on the treeing, we in fact show that E is essentially…

Babel has shown that for an extended class of chordal (6, 3) graphs the coarsest regular simplicial partition is equivalent to the graph's automorphism partition. We give a reversible transformation for any graph to one of these graph by…

We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…

We characterize having Borel isomorphism relation among some weakly minimal trivial theories, namely the examples of families of finite equivalence relations from recent joint work with Laskowski, and tame expansions of…

The $\mathbb{G}_0$-dichotomy due to Kechris, Solecki and Todor\vcevi\'c characterizes the analytic relations having a Borel-measurable countable coloring. We give a version of the $\mathbb{G}_0$-dichotomy for $\boraxi$-measurable countable…

We prove a number of results motivated by global questions of uniformity in computability theory, and universality of countable Borel equivalence relations. Our main technical tool is a game for constructing functions on free products of…