Related papers: Residually finite non-exact groups
Motivated by a question of Bumagin and Wise, we construct a continuum of finitely generated, residually finite groups whose outer automorphism groups are pairwise non-isomorphic finitely generated, non-recursively-presentable groups. These…
We give the first example of a non-linear residually finite 1-related group: < a, t | a^{t^2}=a^2>.
We show that the first $L^2$-betti number of a finitely generated residually finite group can be estimated from below by using ordinary first betti numbers of finite index normal subgroups. As an application we construct a finitely…
We introduce the concept of quantifying the extent to which a finitely generated group is residually finite. The quantification is carried out for some examples including free groups, the first Grigorchuk group, finitely generated nilpotent…
We present two uncountable families of finitely generated residually finite groups all having the same profinite completion. One consists of soluble groups, the other of branch groups.
We study a family of finitely generated residually finite small cancellation groups. These groups are quotients of $F_2$ depending on a subset $S$ of positive integers. Varying $S$ yields continuously many groups up to quasi-isometry.
We study a family of finitely generated residually finite groups. These groups are doubles $F_2*_H F_2$ of a rank-$2$ free group $F_2$ along an infinitely generated subgroup $H$. Varying $H$ yields uncountably many groups up to isomorphism.
The residual finiteness growth of a group quantifies how well approximated the group is by its finite quotients. In this paper, we construct groups with arbitrarily large residual finiteness growth. We also demonstrate a new relationship…
We construct small cancellation labellings for some infinite sequences of finite graphs of bounded degree. We use them to define infinite graphical small cancellation presentations of groups. This technique allows us to provide examples of…
A tubular group $G$ is a finite graph of groups with $\mathbb{Z}^2$ vertex groups and $\mathbb{Z}$ edge groups. We characterize residually finite tubular groups: $G$ is residually finite if and only if its edge groups are separable. Methods…
We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function.…
We construct a finitely generated residually finite group $G$ with the property that every finite index subgroup of $G$ contains a subgroup isomorphic to Promislow's group. Hence $G$ does not have a finite index subgroup with the unique…
A finitely generated solvable group with unbounded iterated identity is constructed.
The question of existence of nonexpansive chaotic almost minimal (CAM) systems, and the existence of CAM systems on every residually finite group, were raised in a recent paper of Van Cyr, Bryna Kra and Scott Schmieding. We construct…
We determine the finite groups whose real irreducible representations have different degrees.
We provide an example of a non-finitely generated group which admits a nonempty strongly aperiodic SFT. Furthermore, we completely characterize the groups with this property in terms of their finitely generated subgroups and the roots of…
We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…
We provide polynomial lower bounds for residual finiteness of residually finite, finitely generated solvable groups that admit infinite order elements in the Fitting subgroup of strict distortion at least exponential. For this class of…
We show that many $2$-dimensional Artin groups are residually finite. This includes $3$-generator Artin groups with labels $\geq 4$ except for $(2m+1, 4,4)$ for any $m\geq 2$. As a first step towards residual finiteness we show that these…
We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…