Related papers: Hyper-u-amenablity and Hyperfiniteness of Treeable…
We introduce the notion of uniform exactness, or uniform amenability at infinity, for discrete groups and prove it for a wide class of groups containing free groups and their limit groups. This shows a novel strong convergence phenomenon…
It is well-known that a Kleinian group is amenable if and only if it is elementary. We establish an analogous property for equivalence relations and foliations with Gromov hyperbolic leaves: they are amenable if and only if they are…
We use $\mathrm{C}^{\ast}$-algebra ultrapowers to give a new construction of the Stone-Cech compactification of a separable, locally compact space. We use this construction to give a new proof of the fact that groups that act isometrically,…
A variation of the Scott analysis of countable structures is applied to actions of non-Archimedean TSI Polish groups acting continuously on a Polish spaces. We give results on the potential Borel complexity spectrum of such groups, and…
We analyze Euclidean spheres in higher dimensions and the corresponding orbit equivalence relations induced by the group of rational rotations from the viewpoint of descriptive set theory. It turns out that such equivalence relations are…
We show that for every countable group, any sequence of approximate homomorphisms with values in permutations can be realized as the restriction of a sofic approximation of an orbit equivalence relation. Moreover, this orbit equivalence…
We show that the groups of finite energy loops and paths (that is, those of Sobolev class $H^1$) with values in a compact connected Lie group, as well as their central extensions, satisfy an amenability-like property: they admit a…
This paper deals with countable products of countable Borel equivalence relations and equivalence relations "just above" those in the Borel reducibility hierarchy. We show that if $E$ is strongly ergodic with respect to $\mu$ then…
In [9] we proved that the space of countable torsion-free abelian groups is Borel complete. In this paper we show that our construction from [9] satisfies several additional properties of interest. We deduce from this that countable…
Let $(X_n,d_n),\,n\in\Bbb N$ be a sequence of pseudo-metric spaces, $p\ge 1$. For $x,y\in\prod_{n\in\Bbb N}X_n$, let $(x,y)\in E((X_n)_{n\in\Bbb N};p)\Leftrightarrow\sum_{n\in\Bbb N}d_n(x(n),y(n))^p<+\infty$. For Borel reducibility between…
We study amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and apply it to algebras associated with finitely generated groups. We show that a group G is amenable if and only if its group…
Computable reducibility is a well-established notion that allows to compare the complexity of various equivalence relations over the natural numbers. We generalize computable reducibility by introducing degree spectra of reducibility and…
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.
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,…
In this paper we study the descriptive complexity of the topological orbit equvalence relation for some Borel classes of Cantor minimal systems. Specifically, we study the Borel class of all Cantor minimal systems with only finitely many…
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver and Harrington-Kechris-Louveau show that with respect to Borel reducibility, any…
We introduce the notions of definable amenability and extreme definable amenability for groups in continuous structures and conduct an extensive analysis of them, drawing parallels with the classical first-order case. We characterize both…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
We prove that the relation of bisimilarity between countable labelled transition systems is $\Sigma_1^1$-complete (hence not Borel), by reducing the set of non-wellorders over the natural numbers continuously to it. This has an impact on…