Related papers: Invariable generation of certain branch groups
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…
A subset S of a finite group G invariably generates G if G = <hsg(s) j s 2 Si > for each choice of g(s) 2 G; s 2 S. We give a tight upper bound on the minimal size of an invariable generating set for an arbitrary finite group G. In response…
A subset $S$ of a group $G$ invariably generates $G$ if $G$ is generated by $\{ s^g(s) | s\in S\} $ for any choice of $g(s)\in G, s\in S$. In case $G$ is topological one defines similarly the notion of topological invariable generation. A…
A subset $S$ of a group $G$ invariably generates $G$ if $G= \langle s^{g(s)} | s \in S\rangle$ for every choice of $g(s) \in G,s \in S$. We say that a group $G$ is invariably generated if such $S$ exists, or equivalently if $S=G$ invariably…
Invariable generation is a topic that has predominantly been studied for finite groups. In 2014, Kantor, Lubotzky, and Shalev produced extensive tools for investigating invariable generation for infinite groups. Since their paper, various…
A group $G$ is invariably generated (IG) if there is a subset $S \subseteq G$ such that for every subset $S' \subseteq G$, obtained from $S$ by replacing each element with a conjugate, $S'$ generates $G$. $G$ is finitely invariably…
Given a finite group $G$, the invariably generating graph of $G$ is defined as the undirected graph in which the vertices are the nontrivial conjugacy classes of $G$, and two classes are adjacent if and only if they invariably generate $G$.…
A subset $S$ of a group $G$ invariably generates $G$ if, when each element of $S$ is replaced by an arbitrary conjugate, the resulting set generates $G.$ An invariable generating set $X$ of $G$ is called minimal if no proper subset of $X$…
A group $G$ is invariably generated if there exists a subset $S \subseteq G$ such that, for every choice $g_s \in G$ for $s \in S$, the group $G$ is generated by $\{ s^{g_s} \mid s \in S \}$. In [GGJ16] Gelander, Golan and Juschenko showed…
The aim of this paper is to describe the structure of the finitely generated subgroups of a family of branch groups, which includes the first Grigorchuk group and the Gupta-Sidki 3-group. This description is made via the notion of block…
A group $G$ is invariably generated by a subset $S$ of $G$ if $G= s^{g(s)} \mid s\in S$ for each choice of $g(s) \in G$, $s \in S$. Answering two questions posed by Kantor, Lubotzky and Shalev, we prove that the free prosoluble group of…
We study branch structures in Grigorchuk-Gupta-Sidki groups (GGS-groups) over primary trees, that is, regular rooted trees of degree $p^n$ for a prime $p$. Apart from a small set of exceptions for $p=2$, we prove that all these groups are…
We describe the block structure of finitely generated subgroups of branch groups with the so-called subgroup induction property, including the first Grigorchuk group $\mathcal{G}$ and the torsion GGS groups.
We consider analogues of Grigorchuk-Gupta-Sidki (GGS-)groups acting on trees of growing degree; the so-called growing GGS-groups. These groups are not just infinite and do not possess the congruence subgroup property, but many of them are…
A finite group $G$ is \emph{coprimely-invariably generated} if there exists a set of generators $\{g_1, ..., g_u\}$ of $G$ with the property that the orders $|g_1|, ..., |g_u|$ are pairwise coprime and that for all $x_1, ..., x_u \in G$ the…
It was conjectured in [KLS14] that for arithmetic groups, Invariable Generation is equivalent to the Congruence Subgroup Property. In view of the famous Serre conjecture this would imply that higher rank arithmetic groups are invariably…
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 prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.
Finding the number of maximal subgroups of infinite index of a finitely generated group is a natural problem that has been solved for several classes of `geometric' groups (linear groups, hyperbolic groups, mapping class groups, etc). Here…
A Grigorchuk-Gupta-Sidki (GGS-)group is a subgroup of the automorphism group of the $p$-adic tree for an odd prime $p$, generated by one rooted automorphism and one directed automorphism. Pervova proved that all torsion GGS-groups do not…