Finite generation of iterated wreath products

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 ${\ldots\wr G_2\wr G_1}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₂\wr G₁{\ldots\wr G_2\wr G_1} is topologically finitely generated if and only if the profinite abelian group ?_{n 3 1} G_n/G￠_n{\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{G\wr \ldots\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 generated branch group, which has maximal subgroups of infinite index.     

Generalized involution models for wreath products

We prove that if a finite group H has a generalized involution model, as defined by Bump and Ginzburg, then the wreath product H ? S _n also has a generalized involution model. This extends the work of Baddeley concerning involution models for wreath products. As an application, we construct a Gel’fand model for wreath products of the form A ? S _n with A abelian, and give an alternate proof of a recent result due to Adin, Postnikov and Roichman describing a particularly elegant Gel’fand model for the wreath product ? _r ? S _n . We conclude by discussing some notable properties of this representation and its decomposition into irreducible constituents, proving a conjecture of Adin, Postnikov and Roichman.     

Extension of Multiply Transitive Permutation Sets

Let G be a k-transitive permutation set on E and let E* = E∪{∞},∞ ? E; if G* is a (k: + 1)-transitive permutation set on E*, G* is said to be an extension of G whenever G _∝ ^* =G. In this work we deal with the problem of extending (sharply) k- transitive permutation sets into (sharply) (k + 1)-transitive permutation sets. In particular we give sufficient conditions for the extension of such sets; these conditions can be reduced to a unique one (which is a necessary condition too) whenever the considered set is a group. Furthermore we establish necessary and sufficient conditions for a sharply k- transitive permutation set (k ≥ 3) to be a group. Math. Subj. Class.: 20B20 Multiply finite transitive permutation groups 20B22 Multiply infinite transitive permutation groups     

Innately transitive subgroups of wreath products in product action

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 product action. This investigation is carried out by observing that such a wreath product preserves a natural Cartesian decomposition of the underlying set. Previously we classified the possible embeddings in the case where the plinth is simple. Here we extend that classification and identify several different types of Cartesian decompositions that can be preserved by an innately transitive group with a non-abelian plinth. These different types of decompositions lead to different types of embeddings of the acting group into wreath products in product action. We also obtain a full characterisation of embeddings of innately transitive groups with diagonal type into such wreath products.

     

Simple exceptional groups of Lie type are determined by their character degrees

Let G be a finite group. Denote by Irr(G) the set of all irreducible complex characters of G. Let ${{\rm cd}(G)=\{\chi(1)\;|\;\chi\in {\rm Irr}(G)\}}$ be the set of all irreducible complex character degrees of G forgetting multiplicities, and let X₁(G) be the set of all irreducible complex character degrees of G counting multiplicities. Let H be any non-abelian simple exceptional group of Lie type. In this paper, we will show that if S is a non-abelian simple group and ${{\rm cd}(S)\subseteq {\rm cd}(H)}$ then S must be isomorphic to H. As a consequence, we show that if G is a finite group with ${{\rm X}_1(G)\subseteq {\rm X}_1(H)}$ then G is isomorphic to H. In particular, this implies that the simple exceptional groups of Lie type are uniquely determined by the structure of their complex group algebras.     

Simple exceptional groups of Lie type are determined by their character degrees

Let G be a finite group. Denote by Irr(G) the set of all irreducible complex characters of G. Let cd(G)={c(1)  |  c ? Irr(G)}{{\rm cd}(G)=\{\chi(1)\;|\;\chi\in {\rm Irr}(G)\}} be the set of all irreducible complex character degrees of G forgetting multiplicities, and let X₁(G) be the set of all irreducible complex character degrees of G counting multiplicities. Let H be any non-abelian simple exceptional group of Lie type. In this paper, we will show that if S is a non-abelian simple group and cd(S) í cd(H){{\rm cd}(S)\subseteq {\rm cd}(H)} then S must be isomorphic to H. As a consequence, we show that if G is a finite group with X₁(G) í X₁(H){{\rm X}_1(G)\subseteq {\rm X}_1(H)} then G is isomorphic to H. In particular, this implies that the simple exceptional groups of Lie type are uniquely determined by the structure of their complex group algebras.     

A note on finite groups in which c-permutability is transitive

A subgroup H of G is c-permutable in G if there exists a permutable subgroup P of?G such that HP=G and H∩P≦H _pG , where H _pG is the largest permutable subgroup of?G contained in?H. A?group G is called CPT-group if c-permutability is transitive in?G. A?number of new characterizations of finite solvable CPT-groups are given.     

The Normalizer Property for Integral Group Rings of a Class of Complete Monomial Groups

Let G = H?S _m be the natural wreath product of H by S _m , where H is a finite 2-closed group and S _m is the symmetric group of degree m. It is shown that the normalizer property holds for G.     

A polynomial-time algorithm for the paired-domination problem on permutation graphs

A set S of vertices in a graph H=(V,E) with no isolated vertices is a paired-dominating set of H if every vertex of H is adjacent to at least one vertex in S and if the subgraph induced by S contains a perfect matching. Let G be a permutation graph and π be its corresponding permutation. In this paper we present an O(mn) time algorithm for finding a minimum cardinality paired-dominating set for a permutation graph G with n vertices and m edges.     

Rational permutation groups containing a full cycle

A finite group whose irreducible complex characters are rational valued is called a rational group. Thus, G is a rational group if and only if N _G (〈x〉)/C _G (〈x〉) ≌ Aut(〈x〉) for every x ∈ G. For example, all symmetric groups and their Sylow 2-subgroups are rational groups. Structure of rational groups have been studied extensively, but the general classification of rational groups has not been able to be done up to now. In this paper, we show that a full symmetric group of prime degree does not have any rational transitive proper subgroup and that a rational doubly transitive permutation group containing a full cycle is the full symmetric group. We also obtain several results related to the study of rational groups.     

Random mappings of scaled graphs

Given a connected finite graph Γ with a fixed base point O and some graph G with a based point we study random 1-Lipschitz maps of a scaled Γ into G. We are mostly interested in the case where G is a Cayley graph of some finitely generated group, where the construction does not depend on the choice of base points. A particular case of Γ being a graph on two vertices and one edge corresponds to the random walk on G, and the case where Γ is a graph on two vertices and two edges joining them corresponds to Brownian bridge in G. We show, that unlike in the case ${G=\mathbb Z^d}$ , the asymptotic behavior of a random scaled mapping of Γ into G may differ significantly from the asymptotic behavior of random walks or random loops in G. In particular, we show that this occurs when G is a free non-Abelian group. Also we consider the case when G is a wreath product of ${\mathbb Z}$ with a finite group. To treat this case we prove new estimates for transition probabilities in such wreath products. For any group G generated by a finite set S we define a functor E from category of finite connected graphs to the category of equivalence relations on such graphs. Given a finite connected graph Γ, the value E _G,S (Γ) can be viewed as an asymptotic invariant of G.     

Taketa’s theorem for some character degree sets

Let cd(G) be the set of irreducible complex character degrees of a finite group G. The Taketa problem conjectures that if G is a finite solvable group, then ${{\rm dl}(G) \leqslant |{\rm cd} (G)|}$ , where dl(G) is the derived length of G. In this note, we show that this inequality holds if either all nonlinear irreducible characters of G have even degrees or all irreducible character degrees are odd. Also, we prove that this inequality holds if all irreducible character degrees have exactly the same prime divisors. Finally, Isaacs and Knutson have conjectured that the Taketa problem might be true in a more general setting. In particular, they conjecture that the inequality ${{\rm dl}(N) \leqslant |{\rm cd} {(G \mid N)}|}$ holds for all normal solvable subgroups N of a group G. We show that this conjecture holds if ${{\rm cd} {(G \mid N')}}$ is a set of non-trivial p–powers for some fixed prime p.     

Hopf Modules and Representations of Finite Wreath Products

For a finite group G and nonnegative integer n ≥ 0, one may consider the associated tower \(G \wr S_{n} := S_{n} \ltimes G^{n}\) of wreath product groups. Zelevinsky associated to such a tower the structure of a positive self-adjoint Hopf algebra (PSH-algebra) R(G) on the direct sum over integers n ≥ 0 of the Grothendieck groups K ₀(R e p?G?S _n ). In this paper, we study the interaction via induction and restriction of the PSH-algebras R(G) and R(H) associated to finite groups H ? G. A class of Hopf modules over PSH-algebras with a compatibility between the comultiplication and multiplication involving the Hopf k ^{t h} -power map arise naturally and are studied independently. We also give an explicit formula for the natural PSH-algebra morphisms R(H) → R(G) and R(G) → R(H) arising from induction and restriction. In an appendix, we consider a family of subgroups of wreath product groups analogous to the subgroups G(m, p, n) of the wreath product cyclotomic complex reflection groups G(m, 1, n).     

On the Artin exponent of some rational groups

A finite group G is called rational if all its irreducible complex characters are rational valued. In this paper, we show that if G is a direct product of finitely many rational Frobenius groups then every rationally represented character of G is a generalized permutation character. Also we show that the same assertion holds when G is a solvable rational group with a Sylow 2-subgroup isomorphic to the dihedral group of order 8 and an abelian normal Sylow 3-subgroup.     

Complete finite semidirect products and wreath products

A complete group is one with a trivial center and with all automorphisms inner. This paper uses group cohomology to give a sufficient condition for a finite semidirect product G = N \rtimes H{G = N \rtimes H} with C _G (N) ≤ N to be complete and proves a partial converse. These results are enough to fully characterize complete finite permutational wreath products and to specialize that characterization in the case of finite standard wreath products.     

On Nearly SS-Embedded Subgroups of Finite Groups

Let H be a subgroup of a finite group G. H is nearly SS-embedded in G if there exists an S-quasinormal subgroup K of G, such that HK is S-quasinormal in G and H ∩ K ≤ HseG, where HseG is the subgroup of H, generated by all those subgroups of H which are S-quasinormally embedded in G. In this paper, the authors investigate the influence of nearly SS-embedded subgroups on the structure of finite groups.     

The distinguishing number of the direct product and wreath product action

Let G be a group acting faithfully on a set X. The distinguishing number of the action of G on X, denoted D _G(X), is the smallest number of colors such that there exists a coloring of X where no nontrivial group element induces a color-preserving permutation of X. In this paper, we consider the distinguishing number of two important product actions, the wreath product and the direct product. Given groups G and H acting on sets X and Y respectively, we characterize the distinguishing number of the wreath product G ≀_Y H in terms of the number of distinguishing colorings of X with respect to G and the distinguishing number of the action of H on Y. We also prove a recursive formula for the distinguishing number of the action of the Cartesian product of two symmetric groups S _m × S _n on [m] × [n].