The computation of normalizers in permutation groups

DOI10.1016/S0747-7171(08)80100-9zbMath0808.20008OpenAlexW2060374449MaRDI QIDQ1192230

Derek F. Holt

Publication date: 27 September 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(08)80100-9

zbMATH Keywords

performancealgorithmsautomorphism groupsnormalizercentralizerscosetsbacktrack searchimplementationstabilizer chainSylow subgroups of permutation groups

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to group theory (20-04) Subgroups of symmetric groups (20B35)

Related Items

Towards Efficient Normalizers of Primitive Groups, Computing normalisers of intransitive groups, Conjugacy of Subgroups of the General Linear Group, Computing in permutation and matrix groups. III: Sylow subgroups, An Inductive Schema for Computing Conjugacy Classes in Permutation Groups, On a family of cyclically-presented fundamental groups, Representing Subgroups of Finitely Presented Groups by Quotient Subgroups, Cyclic Presentations of the Trivial Group

Uses Software

• Cayley

Cites Work

• Computing in permutation and matrix groups. III: Sylow subgroups
• Computing in Permutation and Matrix Groups II: Backtrack Algorithm
• Computing normalizers in permutation groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item