Related papers: Constructing uncountably many groups with the same…
We construct an uncountable family of 3-generated residually finite just-infinite groups with isomorphic profinite completions. We also show that word growth rate is not a profinite property.
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.
We construct the first example of a finitely-presented, residually-finite group that contains an infinite sequence of non-isomorphic finitely-presented subgroups such that each of the inclusion maps induces an isomorphism of profinite…
We construct a finitely presented (two-sided) totally orderable group with insoluble word problem.
This article explores the interplay between the finite quotients of finitely generated residually finite groups and the concept of amenability. We construct a finitely generated, residually finite, amenable group $A$ and an uncountable…
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 introduce a class $\A$ of finitely generated residually finite accessible groups with some natural restriction on one-ended vertex groups in their JSJ-decompositions. We prove that the profinite completion of groups in $\A$ almost…
A finitely generated solvable group with unbounded iterated identity is constructed.
We prove that there exist finitely presented, residually finite groups that are profinitely rigid in the class of all finitely presented groups but not in the class of all finitely generated groups. These groups are of the form $\Gamma…
We give a description of finitely generated prosoluble subgroups of the profinite completion of $3$-manifold groups and virtually compact special groups.
Two finitely generated groups have the same set of finite quotients if and only if their profinite completions are isomorphic. Consider the map which sends (the isomorphism class of) an S-arithmetic group to (the isomorphism class of) its…
We prove that if a Cartesian product of alternating groups is topologically finitely generated, then it is the profinite completion of a finitely generated residually finite group. The same holds for Cartesian producs of other simple groups…
We show that the group constructed in the 2004 paper 'A 2-generated just-infinite profinite group which is not positively finitely generated' by A. Lucchini is in fact hereditarily just infinite and contains every countably based profinite…
It is proved that every finitely generated profinite group with fewer than $2^{\aleph_0}$ conjugacy classes of elements of infinite order is finite
A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…
Let $\C$ be a variety of finite groups. We use profinite Bass--Serre theory to show that if $u:H\hookrightarrow G$ is a map of finitely generated residually $\C$ groups such that the induced map $\hat{u}:\hat{H}\rightarrow\hat{G}$ is a…
We show that property (T) is not profinite, that is, we construct two finitely generated residually finite groups which have isomorphic profinite completions while one admits property (T) and the other does not. This settles a question…
In this note we show that various (geometric/homological) finiteness properties are not profinite properties. For example for every $1 \le k, \ell \le \bbn$, there exist two finitely generated residually finite groups $\Ga_1$ and $\Ga_2$…
This article presents the construction of finitely generated branch groups with uncountably many maximal subgroups using embedding techniques. This addresses a question posed by Grigorchuk.
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…