๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Computing Subgroups by Exhibition in Finite Solvable Groups

โœ Scribed by Bettina Eick; Charles R.B Wright

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
316 KB
Volume
33
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

โœฆ Synopsis

We present practical algorithms to compute subgroups such as Hall systems, system normalizers, F-normalizers and F-covering subgroups in finite solvable groups. An application is an algorithm to calculate head complements in finite solvable groups; that is, complements which are closely related to maximal subgroups. Our algorithms use the technique of exhibiting subgroups.

๐Ÿ“œ SIMILAR VOLUMES

Finite Groups Containing Many Subgroups
Finite Groups Containing Many Subgroups Are Solvable
โœ Marcel Herzog; Patrizia Longobardi; Mercede Maj; Avinoam Mann ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 160 KB

In this paper G denotes a finite group. As is well known, the converse of Lagrange's theorem in group theory does not hold. That is, given a finite group G of order n, and given a divisor d of n, G need not have a subgroup of order d. Indeed, a celebrated theorem of P. Hall states that it suffices t

Computing Sylow Subgroups in Permutation
Computing Sylow Subgroups in Permutation Groups
โœ JOHN CANNON; BRUCE COX; DEREK HOLT ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 371 KB

We describe the theory and implementation of a practical algorithm for computing a Sylow subgroup of a permutation group and for finding an element that conjugates one Sylow subgroup to another. The performance of the current implementations in the Magma system represents a significant improvement o

On the Finite Simple Groups All of Whose
On the Finite Simple Groups All of Whose 2-Local Subgroups Are Solvable
โœ Makoto Hayashi; Yasuhiko Tanaka ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 177 KB

## 2 1 2 1 2 4 2 ลฝ . gam, or a F 2 -amalgam. ## 4 Let G be a nonabelian simple group satisfying the assumption of the ลฝ . Main Theorem. Then G satisfies the assumption of Theorem 2. If 1 or ลฝ . 2 occurs in Theorem 2, we can appeal to some of the existing classification theorems to identify G wi

Locally Finite Groups with All Subgroups
Locally Finite Groups with All Subgroups Normal-by-(Finite Rank)
โœ E.I Khukhro; H Smith ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 194 KB

A group is said to have finite special rank F s if all of its finitely generated subgroups can be generated by s elements. Let G be a locally finite group and suppose that HrH has finite rank for all subgroups H of G, where H denotes the normal core of H in G. We prove that then G has an abelian no