Related papers: A sofic group away from amenable groups
We investigate character degree graphs of solvable groups. In particular, we provide general results that can be used to eliminate which degree graphs can occur as solvable groups. Finally, we show a specific family of graphs cannot occur…
We show that the unrestricted wreath product of a sofic group by an amenable group is sofic. We use this result to present an alternative proof of the known fact that any group extension with sofic kernel and amenable quotient is again a…
We introduce and systematically study linear sofic groups and linear sofic algebras. This generalizes amenable and LEF groups and algebras. We prove that a group is linear sofic if and only if its group algebra is linear sofic. We show that…
We define sofic, weakly sofic, linear sofic and hyperlinear metric groups and discuss some issues involving axiomatizability of these classes in continuous logic.
We introduce the notion of soficity for locally compact groups and list a number of open problems.
Whyte showed that any quasi-isometry between non-amenable groups is a bounded distance from a bijection. In contrast this paper shows that for amenable groups, inclusion of a proper subgroup of finite index is never a bounded distance from…
The goal of this article is to study results and examples concerning finitely presented covers of finitely generated amenable groups. We collect examples of groups $G$ with the following properties: (i) $G$ is finitely generated, (ii) $G$…
We investigate structural properties of non-sofic groups, assuming that such groups exist. We introduce and study two classes: minimal non-sofic groups and $\omega$-non-sofic groups. For minimal non-sofic groups, we establish strong…
We provide a quantitative formulation of the equivalence between hyperlinearity and soficity for amenable groups, showing that every hyperlinear approximation to such a group is essentially produced from a sofic approximation. This…
We answer an open question of Grigorchuk and Zuk about amenability using random walks. Our results separate the class of amenable groups from the closure of subexponentially growing groups under the operations of group extension and direct…
A new flavour of amenability for discrete semigroups is proposed that generalises group amenability and follows from a \Folner-type condition. Some examples are explored, to argue that this new notion better captures some essential ideas of…
We show that residually finite by residually finite extensions are weakly sofic.
In this article we develop a notion of soficity for actions of countable groups on sets. We show two equivalent perspectives, several natural properties and examples. Notable examples include arbitrary actions of both amenable groups and…
Let $S$ be a class of groups and let $f_S (n)$ be the number of isomorphism classes of groups in $S$ of order $n$. Let $f(n)$ count the number of groups of order $n$ up to isomorphism. The asymptotic bounds for $f(n)$ behave differently…
We prove that a limit group over Thompson's group $F$ cannot be an HNN-extension of $F$ with respect to a finitely generated subgroup. On the other hand we give an example of an $F$-limit group which is a centralized HNN-extenstions of $F$.…
A countable group G is called k-linear sofic (for some 0 <k \le 1) if finite subsets of G admit "approximate representations" by complex invertible matrices in the normalized rank metric, so that non-identity elements are k-away from the…
We show that free products of sofic groups with amalgamation over monotileably amenable subgroups are sofic. Consequently, so are HNN extensions of sofic groups relative to homomorphisms of monotileably amenable subgroups. We also show that…
Given sofic approximations for countable, discrete groups $G,H$, we construct a sofic approximation for their wreath product $G\wr H$.
Sofic entropy theory is a generalization of the classical Kolmogorov-Sinai entropy theory to actions of large class of non-amenable groups called sofic groups. This is a short introduction with a guide to the literature.
A semigroup is \emph{amiable} if there is exactly one idempotent in each $\mathcal{R}^*$-class and in each $\mathcal{L}^*$-class. A semigroup is \emph{adequate} if it is amiable and if its idempotents commute. We characterize adequate…