Primitive normalisers in quasipolynomial time

DOI10.1007/s00013-021-01670-5OpenAlexW3210334118MaRDI QIDQ2071768

Colva M. Roney-Dougal, Mun See Chang

Publication date: 31 January 2022

Published in: Archiv der Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

permutation groupsprimitive groupscomputationquasipolynomial timenormaliser problem

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Subgroups of symmetric groups (20B35) Computational methods for problems pertaining to group theory (20-08)

Related Items (1)

Computing normalisers of intransitive groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the orders of primitive groups
• Base sizes of primitive permutation groups
• Minimal and random generation of permutation and matrix groups.
• Normalisers of primitive permutation groups in quasipolynomial time
• Normalizes and permutational isomorphisms in simply-exponential time
• Graph isomorphism in quasipolynomial time [extended abstract]

This page was built for publication: Primitive normalisers in quasipolynomial time