Computing normalizers in permutation groups

DOI10.1016/0196-6774(83)90043-3MaRDI QIDQ3344111zbMATH OpenOpenAlexFDO

Authors Gregory Butler

Publication date 1983

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(83)90043-3

zbMATH Keywords

lower central seriescommutatorbasepermutation groupsFibonacci groupupper central seriesnormal closuresCAYLEYstrong generating setbacktrack algorithmsperformance statisticsSchreier method

Mathematics Subject Classification ID

General theory for finite permutation groups (20B05) Generators, relations, and presentations of groups (20F05) Series and lattices of subgroups (20D30) Software, source code, etc. for problems pertaining to group theory (20-04)

Recommendations

• Computing in permutation and matrix groups. III: Sylow subgroups
• scientific article; zbMATH DE number 1004935
• scientific article; zbMATH DE number 1849958
• Permutation group algorithms based on partitions. I: Theory and algorithms
• scientific article; zbMATH DE number 1263405

Cited in

(20)

• An Improvement of a Function Computing Normalizers for Permutation Groups
• An Inductive Schema for Computing Conjugacy Classes in Permutation Groups
• Effective computation with group homomorphisms
• Computing in permutation and matrix groups. III: Sylow subgroups
• The computation of normalizers in permutation groups
• Permutation group algorithms based on partitions. I: Theory and algorithms
• New refiners for permutation group search
• Normalisers of primitive permutation groups in quasipolynomial time
• The transitive groups of degree twelve
• A method for the computation of normalizers in permutation groups with applications to the construction of primitive groups
• Canonical representation of polynomial expressions with indices
• Conjugacy of Subgroups of the General Linear Group
• An improvement of GAP normalizer function for permutation groups
• Normalizers of \(p\)-subgroups in finite groups.
• Towards efficient normalizers of primitive groups
• Computing the order of a solvable permutation group
• A proof of Holt's algorithm
• Computing matrix group decompositions with respect to a normal subgroup
• Perfect refiners for permutation group backtracking algorithms
• scientific article; zbMATH DE number 2151233 (Why is no real title available?)

This page was built for publication: Computing normalizers in permutation groups

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