Computing normalisers of intransitive groups

DOI10.1016/j.jalgebra.2022.05.001MaRDI QIDQ2142483

Christopher Jefferson, Colva M. Roney-Dougal, Mun See Chang

Publication date: 27 May 2022

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.00388

zbMATH Keywords

permutation groups; backtrack search; computational group theory

Mathematics Subject Classification ID

20-XX: Group theory and generalizations

16-XX: Associative rings and algebras

Related Items

On the normalizer of an iterated wreath product, Perfect refiners for permutation group backtracking algorithms

Uses Software

• GAP

Cites Work

• The computation of normalizers in permutation groups
• Disjoint direct product decompositions of permutation groups
• Primitive normalisers in quasipolynomial time
• The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes
• Constructing transitive permutation groups.
• An improvement of GAP normalizer function for permutation groups
• Is code equivalence easy to decide?
• The Hardness of Code Equivalence over $\mathbb{F}_q$ and Its Application to Code-Based Cryptography
• Normalisers of primitive permutation groups in quasipolynomial time
• Normalizes and permutational isomorphisms in simply-exponential time
• Graph isomorphism in quasipolynomial time [extended abstract]
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item