Related papers: Borel graphable equivalence relations

We address some fundamental problems concerning the structure of idealistic equivalence relations. In particular, we show that, under analytic determinacy, there are continuum many idealistic analytic equivalence relations that are not…

We prove that the automorphisms of any separable C*-algebra that does not have continuous trace are not classifiable by countable structures up to unitary equivalence. This implies a dichotomy for the Borel complexity of the relation of…

Boykin and Jackson recently introduced a property of countable Borel equivalence relations called Borel boundedness, which they showed is closely related to the union problem for hyperfinite equivalence relations. In this paper, we…

We introduce and study a notion of Borel order dimension for Borel quasi orders. It will be shown that this notion is closely related to the notion of Borel dichromatic number for simple directed graphs. We prove a dichotomy, which…

We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations -- that is, as quotients of term algebras over decidable sets…

We consider reducibility of equivalence relations (ERs, for brevity), in a nonstandard domain, in terms of the Borel reducibility and the countably determined (CD, for brevity) reducibility. This reveals phenomena partially analogous to…

In this paper we consider non-archimedean abelian Polish groups whose orbit equivalence relations are all Borel. Such groups are called tame. We show that a non-archimedean abelian Polish group is tame if and only if it does not involve…

In this paper, we show that the arc-connectedness equivalence relation on a Polish subspace of the real plane is an essentially hyperfinite Borel equivalence relation. This result provides the optimal upper bound for such a Borel…

We show that there is a Borel graph on a standard Borel space of Borel chromatic number three that admits a Borel homomorphism to every analytic graph on a standard Borel space of Borel chromatic number at least three. Moreover, we…

We prove that the epimorphism relation is a complete analytic quasi-order on the space of countable groups. In the process, we obtain the result of independent interest that the epimorphism relation on pointed reflexive graphs is complete.

We explore countable ordered Archimedean groups from the point of view of descriptive set theory. We introduce the space of Archimedean left-orderings $\mathrm{Ar}(G)$ for a given countable group $G$, and prove that the equivalence relation…

We show that for any infinite countable group $G$ and for any free Borel action $G \curvearrowright X$ there exists an equivariant class-bijective Borel map from $X$ to the free part $\mathrm{Free}(2^G)$ of the $2$-shift $G \curvearrowright…

For $f \colon [0,1] \rar \real^{+}$, consider the relation $\mathbf{E}_{f}$ on $[0,1]^{\omega}$ defined by $(x_{n}) \mathbf{E}_{f} (y_{n}) \Leftrightarrow \sum_{n < \omega} f(|y_{n} - x_{n}|) < \infty.$ We study the Borel reducibility of…

We study groups that can be defined as Polish, pro-countable groups, as non-archimedean groups with an invariant metric or as quasi-countable groups, i.e., closed subdirect products of countable, discrete groups, endowed with the product…

We show that for any countable homogeneous ordered graph $G$, the conjugacy problem for automorphisms of $G$ is Borel complete. In fact we establish that each such $G$ satisfies a strong extension property called ABAP, which implies that…

A long standing open problem in the theory of hyperfinite equivalence relations asks if the orbit equivalence relation generated by a Borel action of a countable amenable group is hyperfinite. In this paper we show that this question has a…

We demonstrate that the proper homotopy equivalence relation for locally finite graphs is Borel complete. Furthermore, among the infinite graphs, there is a comeager equivalence class. As corollaries, we obtain the analogous results for the…

We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…

We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…

A measurable relation algebra is a relation algebra in which the identity element is a sum of atoms that can be measured in the sense that the "size" of each such atom can be defined in an intuitive and reasonable way (within the framework…