Computing normalizers in permutation groups
From MaRDI portal
Recommendations
Cited in
(21)- Normalizers of \(p\)-subgroups in finite 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
- Computing matrix group decompositions with respect to a normal subgroup
- The transitive groups of degree twelve
- Perfect refiners for permutation group backtracking algorithms
- Canonical representation of polynomial expressions with indices
- A method for the computation of normalizers in permutation groups with applications to the construction of primitive groups
- An improvement of GAP normalizer function for permutation groups
- scientific article; zbMATH DE number 1262448 (Why is no real title available?)
- An Inductive Schema for Computing Conjugacy Classes in Permutation Groups
- scientific article; zbMATH DE number 2151233 (Why is no real title available?)
- Conjugacy of Subgroups of the General Linear Group
- Towards efficient normalizers of primitive groups
- Normalisers of primitive permutation groups in quasipolynomial time
- An Improvement of a Function Computing Normalizers for Permutation Groups
- Computing the order of a solvable permutation group
- A proof of Holt's algorithm
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)