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

Computing normalizers in permutation groups

โœ Scribed by Gregory Butler

Publisher
Elsevier Science
Year
1983
Tongue
English
Weight
641 KB
Volume
4
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Orbit-stabilizer Problems and Computing
Orbit-stabilizer Problems and Computing Normalizers for Polycyclic Groups
โœ Bettina Eick ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 342 KB

We present a practical algorithm to solve the orbit-stabilizer problem for subgroups of the free abelian group Z d under the action of a polycyclic group of automorphisms. As an application we obtain a practical algorithm to compute the normalizer of a subgroup and, similarly, we can solve the subgr

Computing Chief Series, Composition Seri
Computing Chief Series, Composition Series and Socles in Large Permutation Groups
โœ JOHN CANNON; DEREK HOLT ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 461 KB

We describe the theory and implementation of practical algorithms for computing chief and composition series and socles in large permutation groups. The theory is valid for permutation degrees up to 10 000 000, and the current implementations in the Magma system are practical up to degrees of 1 000