Normal subgroups of iterated wreath products of symmetric groups and alternating with symmetric groups
Institute of mathematics, NAS of Ukraine（乌克兰国家科学院数学研究所）
Ruslan Skuratovskii
备注：
05 Conferences. I have make a talk by this topic at conference dedicated to A. I. Starostin in Ekaterinburg (2021) 05 October 2021 - 09 October 2021. pp. 108-110. 2) Conference Malcev Meetings Novosibirsk (2025) "Subwreath Product as Structure of Normal Subgroups of Permutational Wreath Products" 3) AGMA May 26, 2026 Normal Subgroups of Iterated Wreath Products of Symmetric Groups
本文确定了有限与无限迭代圈积$S_{n_1}\wr \ldots \wr S_{n_m}$（$n, m \in \mathbb{N}$）的正规子群及其性质，研究了特殊类正规子群及其阶数，找到这类特殊正规子群的生成元并以Kaloujnine表（卡卢宁表）的形式给出。文章求得置换群圈积的逆极限，明确了集合型稳定子为正规子群的条件，还研究了作为投射有限群的圈积的拓扑，证明其同胚于Cantor集（康托尔集）。
英文摘要：
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 classes of normal subgroups are investigated and their generators are found and presented in the form of Kaloujnine tables. Inverse limit of wreath product of permutation groups is found. Conditions when set-wise stabilizer is normal subgroup are found. In the proposed work a topology of the wreath product as profinite group is studied, is homeomorphic to Cantor set is established.
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 topologically finitely generated, provided that the actions of the groups in $\mathcal{S}$ are not regular. We prove that our bound has the right asymptotic behaviour. We also deduce that other infinitely iterated mixed wreath products of groups in $\mathcal{S}$ are finitely generated. Finally we apply our methods to find explicitly two generators of infinitely iterat…
We study a generalisation of the family of non-(virtually pro-$p$) hereditarily just infinite profinite groups introduced by J.\! S.\! Wilson in 2010. We prove that this family contains groups of finite lower rank. We also show that many groups in this family are not topologically finitely presentable.
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) finitely generated if and only if $\prod_{i=1}^{\infty} (G_i/G_i')$ is finitely generated and the growth of the minimal number of generators of $G_i$ is bounded by $ d...n_1...n_{i-1}$ for a constant $d$. Moreover we give a criterion to decide whether $W_\infty$ is positively finitely generated.
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 and only if the profinite abelian group $\prod_{n\geq 1} G_n/G'_n$ is topologically finitely generated. As a corollary, for a finite transitive group $G$ the minimal number of generators of the wreath power $G\wr...\wr G\wr G$ ($n$ times) is bounded if $G$ is perfect, and grows linearly if $G$ is non-perfect. As a by-product we construct a finitely generate…
We give a partial solution a question of Grigorchuk, Nekrashevych, Sushchanskii and Šunik by giving an algorithm to test whether a finite state element of an infinite iterated (permutational) wreath product $\hat G = \mathbb Z/k\mathbb Z\wr \mathbb Z/k\mathbb Z\wr \mathbb Z/k\mathbb Z\wr >...$ of cyclic groups of order $n$ acts spherically transitively. We can also decide whether two finite state spherically transitive elements of $\hat G$ are conjugate. For general infinite iterated wreath products, an algorithm is presented to determine whether two finite state automorphisms have the same im…
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 hereditarily just infinite profinite group $W$ with composition factors in $\mathcal{X}$ such that any countably based profinite group with composition factors in $\mathcal{X}$ can be embedded into $W$. Additionally we investigate when infinitely iterated wreath products of finite simple groups with respect to product actions are co-Hopfian or non-co-Hopfian.
The size of minimal generating set for commutator of Sylow 2-subgroup of alternating group was found. Given a permutational wreath product of finite cyclic groups sequence we prove that the commutator width of such groups is 1 and we research some properties of its commutator subgroup. It was shown that $(Syl_2 A_{2^k})^2 = Syl'_2 (A_{2^k}), \, k>2$. A new approach to presentation of Sylow 2-subgroups of alternating group ${A_{2^{k}}}$ was applied. As a result the short proof that the commutator width of Sylow 2-subgroups of alternating group ${A_{2^{k}}}$, permutation group ${S_{2^{k}}}$ and …
This paper investigate bounds of the commutator width \cite {Mur} of a wreath product of two groups. The commutator width of direct limit of wreath product of cyclic groups are found. For given a permutational wreath product sequence of cyclic groups we investigate its commutator width and some properties of its commutator subgroup. It was proven that the commutator width of an arbitrary element of the wreath product of cyclic groups $C_{p_i}, \, p_i\in \mathbb{N} $ equals to 1. As a corollary, it is shown that the commutator width of Sylows $p$-subgroups of symmetric and alternating groups $p…
$\mathcal{C}$-Hereditarily conjugacy separable groups and wreath products
School of Computer and Information Sciences, University of Newcastle（纽卡斯尔大学计算机与信息科学学院）；Department of Computer Science, Faculty of Science, University of South Bohemia in České Budějovice（南波希米亚大学理学院计算机科学系）；IMPAN（波兰科学院数学研究所）
Given a permutational wreath product sequence of cyclic groups of prime order we research a commutator width of such groups and some properties of its commutator subgroup. Commutator width of Sylow 2-subgroups of alternating group $A_{2^{k}}$, permutation group $S_{2^k}$ and $C_p \wr B$ were founded. The result of research was extended on subgroups $(Syl_2 {A_{2^k}})'$, $p>2$. The paper presents a construction of commutator subgroup of Sylow 2-subgroups of symmetric and alternating groups. Also minimal generic sets of Sylow 2-subgroups of $A_{2^k}$ were founded. Elements presentation of $(Syl_…
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 the $\text{Alt}(X)$ and $\text{Sym}(X)$ wreath products. In particular, their ratios form a limit if and only if the dimension of the symmetric wreath product is twice the dimension of the alternating wreath product.
Given word on $n$ letters, we study groups which satisfiy "iterated identity" $w$, meaning that for all $x_1, \dots, x_n$ there exists $m$ such that $m$-the iteration of $w$ of Engel type, applied to $x_1, \dots, x_n$, is equal to the identity. We define bounded groups and groups which are fractal with respect to identities. This notion of being fractal can be viewed as a self-similarity conditions for the set of identities, satisfied by a group. In contrast with torsion groups and Engel groups, groups which are fractal with respect to identities appear among finitely generated elementary amen…
We prove that the inverse limit of certain iterated wreath products in product action have complete Hausdorff dimension spectrum with respect to their unique maximal filtration of open normal subgroups. Moreover we can produce explicitly subgroups with a specified Hausdorff dimension.
Let G be a group which has for all n a finite number r_n(G) of irreducible complex linear representations of dimension n. Let $ζ(G,s) = \sum_{n=1}^{\infty} r_n(G) n^{-s}$ be its representation zeta function. First, in case G is a permutational wreath product of H with a permutation group Q acting on a finite set X, we establish a formula for $ζ(G,s)$ in terms of the zeta functions of H and of subgroups of Q, and of the Moebius function associated with the lattice of partitions of X in orbits under subgroups of Q. Then, we consider groups W(Q,k) which are k-fold iterated wreath products of Q, a…
We show that the conjugacy problem in a wreath product $A \wr B$ is uniform-$\mathsf{TC}^0$-Turing-reducible to the conjugacy problem in the factors $A$ and $B$ and the power problem in $B$. If $B$ is torsion free, the power problem for $B$ can be replaced by the slightly weaker cyclic submonoid membership problem for $B$. Moreover, if $A$ is abelian, the cyclic subgroup membership problem suffices, which itself is uniform-$\mathsf{AC}^0$-many-one-reducible to the conjugacy problem in $A \wr B$. Furthermore, under certain natural conditions, we give a uniform $\mathsf{TC}^0$ Turing reduction f…
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 total functions to combine a linearly ordered set of permutation groups. Algebraically speaking, cascade products are explicitly constructed substructures of the iterated wreath product. We show how direct, semidirect and wreath products can be described as cascade products and we also discuss examples of composite groups that can only be constructed exactly as …
The group of alternating colored permutations is the natural analogue of the classical alternating group, inside the wreath product $\mathbb{Z}_r \wr S_n$. We present a 'Coxeter-like' presentation for this group and compute the length function with respect to that presentation. Then, we present this group as a covering of $\mathbb{Z}_{\frac{r}{2}} \wr S_n$ and use this point of view to give another expression for the length function. We also use this covering to lift several known parameters of $\mathbb{Z}_{\frac{r}{2}} \wr S_n$ to the group of alternating colored permutations.
The background of this paper is the following: search of the minimal systems of generators for this class of group which still was not founded also problem of representation for this class of group, exploration of systems of generators for Sylow 2-subgroups $Syl_2{A_{2^k}}$ and $Syl_2{A_{n}}$ of alternating group, finding structure these subgroups. The aim of this paper is to research the structure of Sylow 2-subgroups and to construct a minimal generating system for such subgroups. In other words, the problem is not simply in the proof of existence of a generating set with elements for Sylow …
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 discuss determination of the lower rank for this family. Finally we examine whether the groups in this family admit a finite profinite presentation.
It is observed that the conjugacy growth series of the infinite fini-tary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed, for other generating sets, for restricted permutational wreath products of finite groups by the finitary symmetric group, and for alternating groups. Similar methods are used to compute usual growth polynomials and conjugacy growth polynomials for finite symmetric groups and alternating groups, with respect to various generating sets of transpositions. Comput…
In this article we study the automorphism groups of binary cyclic codes. In particular, we provide explicit constructions for codes whose automorphism groups can be described as (a) direct products of two symmetric groups or (b) iterated wreath products of several symmetric groups. Interestingly, some of the codes we consider also arise in the context of regular lattice graphs and permutation decoding.
The background of this paper is the following: search of the minimal systems of generators for this class of group which still was not founded also problem of representation for this class of group, exploration of systems of generators for Sylow 2-subgroups $Syl_2{A_{2^k}}$ and $Syl_2{A_{n}}$ of alternating group, finding structure of these subgroups. The authors of article "Structure of 2-sylow subgroup of symmetric and alternating group" U.~Dmitruk, V.~Suschansky didn't proof minimality of finding by them system of generators for such Sylow 2-subgroups of $A_n$ and structure of it were found…
Whiston proved that the maximum size of an irredundant generating set in the symmetric group $S_n$ is $n-1$, and Cameron and Cara characterized all irredundant generating sets of $S_n$ that achieve this size. Our goal is to extend their results. Using properties of transitive subgroups of the symmetric group, we are able to classify all irredundant generating sets with sizes $n-2$ in both $A_n$ and $S_n$. Next, based on this classification, we derive other interesting properties for the alternating group $A_n$. Finally, using Whiston's lemma, we will derive the formulas for calculating dimensi…
This article is concerned with perfect isometries between blocks of finite groups. Generalizing a method of Enguehard to show that any two p-blocks of (possibly different) symmetric groups with the same weight are perfectly isometric, we prove analogues of this result for p-blocks of alternating groups (where the blocks must also have the same sign when p is odd), of double covers of alternating and symmetric groups (for p odd, and where we obtain crossover isometries when the blocks have opposite signs),of complex reflection groups G(d,1,n) (for d prime to p), of Weyl groups of type B and D (…
