A generalization of Hall-complementation in finite supersolvable groups

The aim of this paper is to prove certain characterization theorems for groups in which permutability is a transitive relation, the so called $${\mathcal{PT}}$$ -groups. In particular, it is shown that the finite solvable $${\mathcal{PT}}$$ -groups, the finite solvable groups in which every subnormal subgroup of defect two is permutable, the finite solvable groups in which every normal subgroup is permutable sensitive, and the finite solvable groups in which conjugate-permutability and permutability coincide are all one and the same class. This follows from our main result which says that the finite modular p-groups, p a prime, are those p-groups in which every subnormal subgroup of defect two is permutable or, equivalently, in which every normal subgroup is permutable sensitive. However, there exist finite insolvable groups which are not $${\mathcal{PT}}$$ -groups but all subnormal subgroups of defect two are permutable.

A normal Hall subgroup $N$ of a group $G$ is a normal subgroup with its order coprime with its index. Schur-Zassenhaus theorem states that every normal Hall subgroup has a complement subgroup, that is a set of coset representatives H which also forms a subgroup of G. In this paper, we present a framework to test isomorphism of groups with at least one normal Hall subgroup, when groups are given as multiplication tables. To establish the framework, we first observe that a proof of Schur-Zassenhaus theorem is constructive, and formulate a necessary and sufficient condition for testing isomorphism in terms of the associated actions of the semidirect products, and isomorphisms of the normal parts and complement parts. We then focus on the case when the normal subgroup is abelian. Utilizing basic facts of representation theory of finite groups and a technique by Le Gall [STACS 2009], we first get an efficient isomorphism testing algorithm when the complement has bounded number of generators. For the case when the complement subgroup is elementary abelian, which does not necessarily have bounded number of generators, we obtain a polynomial time isomorphism testing algorithm by reducing to generalized code isomorphism problem. A solution to the latter can be obtained by a mild extension of the singly exponential (in the number of coordinates) time algorithm for code isomorphism problem developed recently by Babai. Enroute to obtaining the above reduction, we study the following computational problem in representation theory of finite groups: given two representations rho and tau of a group $H$ over Z_p^d , p a prime, determine if there exists an automorphism phi:H -> H, such that the induced representation rho_phi=rho o phi and tau are equivalent, in time poly(|H|,p^d).

Results are obtained concerning normal subgroups of the automorphism groups of certain infinite trees. These structures are mostly ℵo-categorical, and are trees in a poset-theoretic but not graph-theoretic sense. It is shown that the automorphism group has a smallest non-trivial normal subgroup, a largest proper normal subgroup, and at least 22ο normal subgroups between these two. We also obtain and use some results on groups of automorphisms of chains.

We give efficient quantum algorithms for the problems of Hidden Translation and Hidden Subgroup in a large class of non-abelian solvable groups including solvable groups of constant exponent and of constant length derived series. Our algorithms are recursive. For the base case, we solve efficiently Hidden Translation in $\Z_{p}^{n}$, whenever $p$ is a fixed prime. For the induction step, we introduce the problem Translating Coset generalizing both Hidden Translation and Hidden Subgroup, and prove a powerful self-reducibility result: Translating Coset in a finite solvable group $G$ is reducible to instances of Translating Coset in $G/N$ and $N$, for appropriate normal subgroups $N$ of $G$. Our self-reducibility framework combined with Kuperberg's subexponential quantum algorithm for solving Hidden Translation in any abelian group, leads to subexponential quantum algorithms for Hidden Translation and Hidden Subgroup in any solvable group.

We give efficient quantum algorithms for the problems of Hidden Translation and Hidden Subgroup in a large class of non-abelian solvable groups including solvable groups of constant exponent and of constant length derived series. Our algorithms are recursive. For the base case, we solve efficiently Hidden Translation in $\Z_{p}^{n}$, whenever $p$ is a fixed prime. For the induction step, we introduce the problem Translating Coset generalizing both Hidden Translation and Hidden Subgroup, and prove a powerful self-reducibility result: Translating Coset in a finite solvable group $G$ is reducible to instances of Translating Coset in $G/N$ and $N$, for appropriate normal subgroups $N$ of $G$. Our self-reducibility framework combined with Kuperberg's subexponential quantum algorithm for solving Hidden Translation in any abelian group, leads to subexponential quantum algorithms for Hidden Translation and Hidden Subgroup in any solvable group.

This article began as a study of the structure of infinite permutation groups $G$ in which point stabilisers are finite and all infinite normal subgroups are transitive. That led to two variations. One is the generalisation in which point stabilisers are merely assumed to satisfy min-n, the minimal condition on normal subgroups. The groups $G$ are then of two kinds. Either they have a maximal finite normal subgroup, modulo which they have either one or two minimal nontrivial normal subgroups, or they have a regular normal subgroup $M$ which is a divisible abelian $p$-group of finite rank. In the latter case the point stabilisers are finite and act irreducibly on a $p$-adic vector space associated with $M$. This leads to our second variation, which is a study of the finite linear groups that can arise.

All groups considered are finite. A group has a trivial Frattini subgroup if and only if every nontrivial normal subgroup has a proper supplement.The property is normal subgroup closed, but neither subgroup nor quotient closed. It is subgroup closed if and only if the group is elementary, i.e. all Sylow subgroups are elementary abelian. If G is solvable, then G and all its quotients have trivial Frattini subgroup if and only if every normal subgroup of G has a complement. For a nilpotent group, every nontrivial normal subgroup has a supplement if and only if the group is elementary abelian. Consequently, the center of a group in which every normal subgroup has a supplement is an elementary abelian direct factor.

Finite supersolvable groups and Hall normally embedded subgroups of prime power order

In this paper we discuss the word normalization problem in pc presented finite supersolvable groups: given two group elements a and b in normal form the normal form of the product a·b is to be computed. As an alternative to classical collection strategies we present a new DFT-based strategy, which uses fragments of certain irreducible representations of the underlying group. This strategy allows an explicit running time analysis. For example, in the special case of a pc presented p-group G of order pn one needs at most 5·p·n2 additions in ℤe:=ℤ/eℤ for the computation of the normal form, where e denotes the exponent of G. Interpreting pc presentations as polynomials in multivariate non-commutative polynomial rings we derive an algorithm for fast polynomial division.

On a class of inseparable finite groups

Let P be a nontrivial p-group. A chain of subgroups is called a maximal chain of P provided that In this article, we determine the structure of finite groups having π-quasinormally embedded subgroups of a maximal chain of Sylow subgroups. We obtain new characterizations of finite p-nilpotent and supersolvable groups.

This chapter continues the development of group theory begun in Chapter IV, the main topics being the use of generators and relations, representation theory for finite groups, and group extensions. Representation theory uses linear algebra and inner-product spaces in an essential way, and a structure-theory theorem for finite groups is obtained as a consequence. Group extensions introduce the subject of cohomology of groups.Sections 1–3 concern generators and relations. The context for generators and relations is that of a free group on the set of generators, and the relations indicate passage to a quotient of this free group by a normal subgroup. Section 1 constructs free groups in terms of words built from an alphabet and shows that free groups are characterized by a certain universal mapping property. This universal mapping property implies that any group may be defined by generators and relations. Computations with free groups are aided by the fact that two reduced words yield the same element of a free group if and only if the reduced words are identical. Section 2 obtains the Nielsen-Schreier Theorem that subgroups of free groups are free. Section 3 enlarges the construction of free groups to the notion of the free product of an arbitrary set of groups. Free product is what coproduct is for the category of groups; free groups themselves may be regarded as free products of copies of the integers.Sections 4–5 introduce representation theory for finite groups and give an example of an important application whose statement lies outside representation theory. Section 4 contains various results giving an analysis of the space C(G, ?) of all complex-valued functions on a finite group G. In this analysis those functions that are constant on conjugacy classes are shown to be linear combinations of the characters of the irreducible representations. Section 5 proves Burnside’s Theorem as an application of this theory—that any finite group of order paqb with p and q prime and with a+b > 1 has a nontrivial normal subgroup.Section 6 introduces cohomology of groups in connection with group extensions. If N is to be a normal subgroup of G and Q is to be isomorphic to G/N, the first question is to parametrize the possibilities for G up to isomorphism. A second question is to parametrize the possibilities for G if G is to be a semidirect product of N and Q.

We consider the coset poset associated with the families of proper subgroups, proper subgroups of finite index and proper normal subgroups of finite index. We investigate under which conditions those coset posets have contractible geometric realizations.

Let G be a finite group with an abelian normal subgroup N. When does N have a unique conjugacy class of complements in G? We consider this question with a focus on properties of maximal subgroups. As corollaries we obtain Theorems 1.6 and 1.7 which are closely related to a result by Parker and Rowley on supplements of a nilpotent normal subgroup [3, Theorem 1]. Furthermore, we consider families of maximal subgroups of G closed under conjugation whose intersection equals Φ ⁢ ( G ) {\Phi(G)} . In particular, we characterize the soluble groups having a unique minimal family with this property (Theorem 2.3, Remark 2.4). In the case when Φ ⁢ ( G ) = 1 {\Phi(G)=1} , these are exactly the soluble groups in which each abelian normal subgroup has a unique conjugacy class of complements.

We establish analogs of the three Bieberbach theorems for a lattice \(\Gamma\) in a semidirect product \(\mathsf{K}\rtimes\mathsf{K}\) where \(\mathsf{S}\) is a connected, simply connected solvable Lie group and \(\mathsf{K}\) is a compact subgroup of its automorphism group. We first prove that the action of \(\Gamma\) on \(\mathsf{S}\) is metrically equivalent to an action of \(\Gamma\) on a supersolvable Lie group. The latter is shown to be determined by \(\Gamma\) itself up to an affine diffeomorphism. Then we characterize these lattices algebraically as polycrystallographic groups. Furthermore, we realize any polycrystallographic group \(\Gamma\) as a lattice in a semidirect product \(\mathsf{S}\rtimes\mathsf{F}\) with \(\mathsf{F}\) being a finite group whose order is bounded by a constant only depending on the dimension of \(\mathsf{S}\). This generalization of the first Bieberbach theorem is used to obtain a partial generalization of the third one as well. Finally we show for any torsion free closed subgroup \(\Upsilon \subset \mathsf{K}\rtimes\mathsf{K}\) that the quotient \(\mathsf{S}/\Upsilon\) is the total space of a vector bundle over a compact manifold B, where B is the quotient of a solvable Lie group by a torsion free polycrystallographic group.