Polynomial-time normalizers

MaRDI QIDQ5414560zbMATH OpenFDO

Authors Takunari Miyazaki, Eugene M. Luks

Publication date 6 May 2014

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2058/0.html

zbMATH Keywords

\(\Gamma_d\) groupspermutation-group computationsolvable groupssubspace stabilizers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 2151233
• scientific article; zbMATH DE number 96386
• Primitive normalisers in quasipolynomial time
• scientific article; zbMATH DE number 475362
• Finding Sylow normalizers in polynomial time

Cited in

(12)

• Primitive normalisers in quasipolynomial time
• Isomorphism testing of groups of cube-free order
• On Cayley representations of central Cayley graphs over almost simple groups
• On 2-closures of rank 3 groups
• A fast isomorphism test for groups whose Lie algebra has genus 2
• scientific article; zbMATH DE number 7599997 (Why is no real title available?)
• Towards efficient normalizers of primitive groups
• Normalisers of primitive permutation groups in quasipolynomial time
• Quadratic-Time Algorithms for Normal Elements
• Two-closure of rank \(3\) groups in polynomial time
• Hypergraph isomorphism for groups with restricted composition factors
• Computational group theory: bedrock and new frontiers

Describes a project that uses

Uses Software

• GAP
• Magma

This page was built for publication: Polynomial-time normalizers

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