Related papers: Finite generation of iterated wreath products in p…

Let $(G_n,X_n)$ be a sequence of finite transitive permutation groups with uniformly bounded number of generators. We prove that the infinitely iterated permutational wreath product $...\wr G_2\wr G_1$ is topologically finitely generated if…

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)…

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

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 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…

We give a partial solution a question of Grigorchuk, Nekrashevych, Sushchanskii and \v{S}uni\'k by giving an algorithm to test whether a finite state element of an infinite iterated (permutational) wreath product $\hat G = \mathbb…

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 $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 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…

We consider the finitely generated groups acting on a regular tree with almost prescribed local action. We show that these groups embed as cocompact irreducible lattices in some locally compact wreath products. This provides examples of…

The degree of commutativity of a finite group is the probability that two uniformly and randomly chosen elements commute. This notion extends naturally to finitely generated groups $G$: the degree of commutativity $\text{dc}_S(G)$, with…

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 prove necessary and sufficient conditions for when graph wreath products are residually finite, generalising known results for the permutational wreath product and free product cases.

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 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…

Normal subgroups and there properties for finite and infinite iterated wreath products $S_{n_1}\wr \ldots \wr S_{n_m}$, $n, m \in \mathbb{N}$ are founded. The special classes of normal subgroups and there orders are investigated. Special…

A permutation group is innately transitive if it has a transitive minimal normal subgroup, which is referred to as a plinth. We study the class of finite, innately transitive permutation groups that can be embedded into wreath products in…

We examine the conjugacy growth series of all wreath products of the finitary permutation groups $\text{Sym}(X)$ and $\text{Alt}(X)$ for an infinite set $X$. We determine their asymptotics, and we characterize the limiting behavior between…

Motivated by computational efficiency in algebraic automata theory here we define the cascade product of permutation groups as an external product, as a generic extension. It is the most general hierarchical product that uses arbitrary…