An improvement to the centralizer algorithm for permutation groups

DOI10.1145/1089402.1089404MaRDI QIDQ3718895zbMATH OpenOpenAlexFDO

Authors Gregory Butler

Publication date 1985

Published in ACM SIGSAM Bulletin (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1089402.1089404

zbMATH Keywords

algorithmcentralizerpermutation groupstrong generating set

Mathematics Subject Classification ID

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

Recommendations

• The structure of the centralizer of a permutation
• Centralizers of transitive permutation groups and applications to Galois theory
• scientific article; zbMATH DE number 26775
• scientific article; zbMATH DE number 3989617
• Fundamental algorithms for permutation groups
• scientific article; zbMATH DE number 434875
• Improved methods for the construction of relative invariants for permutation groups
• Publication:4893596
• An improvement of GAP normalizer function for permutation groups
• An algorithm for solving the factorization problem in permutation groups

Cited in

(6)

• An Improvement of a Function Computing Normalizers for Permutation Groups
• Fast computation of the centralizer of a permutation group in the symmetric group
• An improved rewriting-number algorithm
• Biased tadpoles: a fast algorithm for centralizers in large matrix groups
• Normalizers of \(p\)-subgroups in finite groups.
• The element centralizers of symmetric group

This page was built for publication: An improvement to the centralizer algorithm for permutation groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3718895)