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 image in the abelianization.
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 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.
$\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（波兰科学院数学研究所）
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.
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…
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…
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 …
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.
A group is said to be self-similar provided it admits a faithful state-closed representation on some regular $m$-tree and the group is said to be transitive self-similar provided additionally it induces transitive action on the first level of the tree. A standard approach for constructing a transitive self-similar representation of a group has been by way of a single virtual endomorphism of \ the group in question. Recently, it was shown that this approach when applied to the restricted wreath product $% \mathbb{Z}\wr \mathbb{Z}$ could not produce a faithful transitive self-similar representat…
The group of isometries W of a regular rooted tree, and many of its subgroups with branching structure, have groups of automorphisms induced by conjugation in W. This fact has stimulated the computation of the group of automorphisms of such well-known examples as the group G studied by R. Grigorchuk, and the group H studied by N. Gupta and the second author. In this paper, we pursue the larger theme of towers of automorphisms of groups of tree isometries such as G and H. We describe this tower for all groups acting on the binary rooted tree which decompose as infinitely iterated wreath product…
