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 m
β¦ LIBER β¦
Cover-avoid subgroups in finite solvable groups
β Scribed by J.D Gillam
- Publisher
- Elsevier Science
- Year
- 1974
- Tongue
- English
- Weight
- 336 KB
- Volume
- 29
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Computing Subgroups by Exhibition in Fin
β
Bettina Eick; Charles R.B Wright
π
Article
π
2002
π
Elsevier Science
π
English
β 316 KB
Finite Groups Containing Many Subgroups
β
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
Finite solvable groups containing maxima
β
Hermann Simon
π
Article
π
1968
π
Elsevier Science
π
English
β 536 KB
On subgroups of finite solvable groups I
β
Avinoam Mann
π
Article
π
1972
π
Elsevier Science
π
English
β 466 KB
Non-solvable finite groups whose subgrou
β
Adaouia BensaΓ―d; Robert W. van der Waall
π
Article
π
1990
π
Elsevier Science
π
English
β 854 KB
The poset of conjugacy classes of subgro
β
Volkmar Welker
π
Article
π
1992
π
Elsevier Science
π
English
β 788 KB