Related papers: Sofic equivalence relations

The notion of sofic equivalence relation was introduced by Gabor Elek and Gabor Lippner. Their technics employ some graph theory. Here we define this notion in a more operator algebraic context, starting from Connes' embedding problem, and…

We present an elementary description of sofic equivalence relations, as well as some permanence properties for soficity. We answer a question by Conley, Kechris and Tucker-Drob of determining soficity in terms of the full group for…

This is an expanded lecture note for "Masterclass on sofic groups and applications to operator algebras" (University of Copenhagen, 5-9 November 2012). It is about algebraic aspects of the Connes Embedding Conjecture. It contains new proofs…

We study computably enumerable equivalence relations (ceers) on N and unravel a rich structural theory for a strong notion of reducibility among ceers.

Sofic and hyperlinear groups are the countable discrete groups that can be approximated in a suitable sense by finite symmetric groups and groups of unitary matrices. These notions turned out to be very deep and fruitful, and stimulated in…

We investigate the relation of countable closed subsets of the reals with respect to continuous monotone embeddability; we show that there are exactly aleph_1 many equivalence classes with respect to this embeddability relation. This is an…

We show that the theory of the partial order of computably enumerable equivalence relations (ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same result for the structure comprised of the dark ceers and the…

We introduce the notions of u-amenability and hyper-u-amenability for countable Borel equivalence relations, strong forms of amenability that are implied by hyperfiniteness. We show that treeable, hyper-u-amenable countable Borel…

Given an L_{\omega_1 \omega}-elementary class C, that is the collection of the countable models of some L_{\omega_1 \omega}-sentence, denote by \cong_C and \equiv_C the analytic equivalence relations of, respectively, isomorphism and…

We introduce the notion of amenability for affine algebras. We characterize amenability by Folner-sequences, paradoxicality and the existence of finitely invariant dimension-measures. Then we extend the results of Rowen on ranks, from…

We give an alternate proof of a Theorem of Elek and Szabo establishing L\"uck's determinant conjecture for sofic groups. Our proof is based on traces on group C*-algebras. We briefly discuss the relation with Atiyah's problem on the…

Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility $\leq_c$. This gives rise to a rich degree-structure. In this…

We present an alternative approach to the result of Guentner, Higson, and Weinberger concerning the Baum-Connes conjecture for finitely generated subgroups of SL(2,C). Using finite-dimensional methods, we show that the Baum-Connes assembly…

This article is concerned with measure equivalence and uniform measure equivalence of locally compact, second countable groups. We show that two unimodular, locally compact, second countable groups are measure equivalent if and only if they…

We introduce a technique for producing a measure coupling between two sofic groups from a family of maps between their sofic approximations. We exploit this to construct measure couplings between pairs of groups with prescribed…

We prove an intrinsic equivalence between strong hypercontractivity and a strong logarithmic Sobolev inequality for the cone of logarithmically subharmonic functions. We introduce a new large class of measures, Euclidean regular and…

The decidability of equivalence for three important classes of tree transducers is discussed. Each class can be obtained as a natural restriction of deterministic macro tree transducers (MTTs): (1) no context parameters, i.e., top-down tree…

We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…

Motivated by Williams' problem of measuring novel differences between shift equivalence (SE) and strong shift equivalence (SSE), we introduce three equivalence relations that provide new ways to obstruct SSE while merely assuming SE. Our…

A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…