Related papers: Countable Borel treeable equivalence relations are…
We study Borel equivalence relations equipped with a uniformly Borel family of Polish topologies on each equivalence class, and more generally, standard Borel groupoids equipped with such a family of topologies on each connected component.…
We introduce and study Polish topologies on various spaces of countable enumerated groups, where an enumerated group is simply a group whose underlying set is the set of natural numbers. Using elementary tools and well known examples from…
The Clifford group associated with a finite abelian group gives rise to a natural extension by the corresponding symplectic group. We prove that this extension splits as a semidirect product if and only if the group order is not divisible…
We extend some results of Carderi and Le Ma\^itre on full groups in the probability context to the infinite measure one: there exists at most one Polish group topology (refining the weak topology and coarser than the uniform topology) on an…
It is proved that the relation of isomorphism between separable Banach spaces is a complete analytic equivalence relation, i.e., that any analytic equivalence relation Borel reduces to it. Thus, separable Banach spaces up to isomorphism…
The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with…
Let $C,A$ be countable abelian groups. In this paper we determine the complexity of classifying extensions $C$ by $A$, in the cases when $C$ is torsion-free and $A$ is a $p$-group, a torsion group with bounded primary components, or a free…
Let $F_{\omega_1}$ be the countable admissible ordinal equivalence relation defined on ${}^\omega 2$ by $x \ F_{\omega_1} \ y$ if and only if $\omega_1^x = \omega_1^y$. It will be shown that $F_{\omega_1}$ is classifiable by countable…
We study a strengthening of the notion of a universally meager set and its dual counterpart that strengthens the notion of a universally null set. We say that a subset $A$ of a perfect Polish space $X$ is countably perfectly meager…
We prove a number of results about countable Borel equivalence relations with forcing constructions and arguments. These results reveal hidden regularity properties of Borel complete sections on certain orbits. As consequences they imply…
We prove that in some cases definable thin sets (including chains) of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic thin sets, ROD thin sets in the Solovay model, and $\Sigma^1_2$…
Our first motivation was the question: can a countable structure have an automorphism group, which a free uncountable group? This is answered negatively in [Sh:744]. Lecturing in a conference in Rutgers, February 2001, I was asked whether I…
Let $G$ be a Polish group and let $H \leq G$ be a compact subgroup. We prove that there exists a Borel set $T \subset G$ which is simultaneously a complete set of coset representatives of left and right cosets, provided that a certain index…
We prove a characterization of the amenability of countable Borel equivalence relations in terms of the uniform Liouville property for group actions on their classes. Furthermore, inspired by a well-known amenability criterion for locally…
We consider a large family of theories of equivalence relations, each with finitely many classes, and assuming the existence of an $\omega$-Erdos cardinal, we determine which of these theories are Borel complete. We develop machinery,…
We study the class of analytic binary relations on Polish spaces, compared with the notions of continuous reducibility or injective continuous reducibility. In particular, we characterize when a locally countable Borel relation is $\Sigma$…
Let H be a product of countably infinite number of copies of an uncountable Polish space X. Let $\Sigma_\xi$ $(\bar {\Sigma}_\xi)$ be the class of Borel sets of additive class \xi for the product of copies of the discrete topology on X (the…
We determine the exact complexity of classifying compact metric spaces up to homeomorphism. More precisely, the homeomorphism relation on compact metric spaces is Borel bi-reducible with the complete orbit equivalence relation of Polish…
We contribute to a recent research program which aims at revisiting the study of the complexity of word problems, a major area of research in combinatorial algebra, through the lens of the theory of computably enumerable equivalence…
We prove that the homeomorphism problem for connected compact metric spaces is Borel bireducible with a universal orbit equivalence relation induced by a Borel action of a Polish group.