相关论文: Finite generation of iterated wreath products

Given a sequence of $(G_i)_{i \in \N}$ of finite transitive groups of degree $n_i$, let $W_\infty$ be the inverse limit of the iterated permutational wreath products of the first m groups. We prove that $W_\infty$ is (topologically)…

Let $\mathcal{S}$ be a sequence of finite perfect transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated wreath product in product action of the groups in $\mathcal{S}$ is…

We show that there are hereditarily just infinite groups of any subgroup growth type between $n$ and $n^{\log n}$. This is obtained calculating the subgroup growth type of a family of hereditarily just infinite profinite groups obtained via…

We study infinitely iterated wreath products of finite permutation groups with respect to product actions. In particular, we prove that, for every non-empty class of finite simple groups $\mathcal{X}$, there exists a finitely generated…

Let $G_{1}$, $G_{2}$, ... be a sequence of groups each of which is either an alternating group, a symmetric group or a cyclic group and construct a sequence $(W_{i})$ of wreath products via $W_{1} = G_{1}$ and, for each $i \geq 1$, $W_{i+1}…

We characterize which permutational wreath products W^(X)\rtimes G are finitely presented. This occurs if and only if G and W are finitely presented, G acts on X with finitely generated stabilizers, and with finitely many orbits on the…

A subset $\left\{x_{1},x_{2},\hdots,x_{d}\right\}$ of a group $G$ \emph{invariably generates} $G$ if $\left\{x_{1}^{g_{1}},x_{2}^{g_{2}},\hdots,x_{d}^{g_{d}}\right\}$ generates $G$ for every $d$-tuple $(g_{1},g_{2}\hdots,g_{d})\in G^{d}$.…

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…

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…

Generalizing results of Higman and Houghton on varieties generated by wreath products of finite cycles, we prove that the (direct or cartesian) wreath product of arbitrary abelian groups $A$ and $B$ generates the product variety $var (A)…

Let G1, G2, ... be a sequence of almost simple groups and construct a sequence (Wi) of wreath products via W1 = G1 and, for each i > 1, Wi+1 = Gi+1 wr Wi via the regular action of each Gi. We determine the minimum number d(Wi) of generators…

We find some sufficient conditions under which the permutational wreath product of two groups has a minimal generating set. In particular we prove that for a regular rooted tree the group of all automorphisms and the group of all…

Let $G$ be an irreducible imprimitive subgroup of $\operatorname{GL}_n(\mathbb{F})$, where $\mathbb{F}$ is a field. Any system of imprimitivity for $G$ can be refined to a nonrefinable system of imprimitivity, and we consider the question…

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…

We provide lower estimates on the minimal number of generators of the profinite completion of free products of finite groups. In particular, we show that if C_1,...,C_n are finite cyclic groups then there exists a finite group G which is…

We show that the wreath product $G \wr \mathbb{Z}^n$ of any finitely generated group $G$ with $\mathbb{Z}^n$ has finite palindromic width. We also show that $C \wr A$ has finite palindromic width if $C$ has finite commutator width and $A$…

Let $G$ be a finitely generated group. We prove that the $n$-fold tensor product $G^{\otimes n}$ is finite (resp. polycyclic) if and only $G$ is finite (resp. polycyclic). Further, assuming that $G$ is finitely presented, we show that…

Let I be a finite partially ordered set and let (Sym({\Delta}i),{\Delta}i)i be a sequence of symmetric groups indexed by I. Construct the generalised wreath product (F, {\Delta}) on this sequence of permutation groups. We determine the…

We show that the wreath product of two finite symmetric or alternating groups is 2-generated.

We study a family of hereditarily just infinite profinite groups obtained by iterated wreath products introduced by J. Wilson in 2010. We find explicit generators for this family in a number of cases using combinatorial methods. We then…