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

Computing the Subgroups of a Permutation Group

โœ Scribed by John J. Cannon; Bruce C. Cox; Derek F. Holt


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
279 KB
Volume
31
Category
Article
ISSN
0747-7171

No coin nor oath required. For personal study only.

โœฆ Synopsis


A new method for computing the conjugacy classes of subgroups of a finite group is described.


๐Ÿ“œ SIMILAR VOLUMES


Computing Sylow Subgroups in Permutation
โœ 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

Transitive Subgroups of Primitive Permut
โœ Martin W. Liebeck; Cheryl E. Praeger; Jan Saxl ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 492 KB

to helmut wielandt on the occasion of his 90th birthday We investigate the finite primitive permutation groups G which have a transitive subgroup containing no nontrivial subnormal subgroup of G. The conclusion is that such primitive groups are rather rare, and that their existence is intimately co

Sylow Permutable Subnormal Subgroups of
โœ A. Ballester-Bolinches; R. Esteban-Romero ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 104 KB

## dedicated to john cossey on the occasion of his 60th birthday An extension of the well-known Frobenius criterion of p-nilpotence in groups with modular Sylow p-subgroups is proved in the paper. This result is useful to get information about the classes of groups in which every subnormal subgrou

On the Movement of a Permutation Group
โœ Peter M. Neumann; Cheryl E. Praeger ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 56 KB
Subgroups of the Nottingham Group
โœ Rachel Camina ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 214 KB
Computing Subgroups Invariant Under a Se
โœ A. Hulpke ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 442 KB

This article describes an algorithm for computing up to conjugacy all subgroups of a finite solvable group that are invariant under a set of automorphisms. It constructs the subgroups stepping down along a normal chain with elementary abelian factors.