Computing normalizers of permutation groups efficiently using isomorphisms of association schemes

DOI10.1145/345542.345637MaRDI QIDQ3454768zbMATH OpenOpenAlexFDO

Authors Izumi Miyamoto

Publication date 26 November 2015

Published in Proceedings of the 2000 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/345542.345637

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cited in

(5)

• Computing normalisers of intransitive groups
• Constructing transitive permutation groups.
• scientific article; zbMATH DE number 2151233 (Why is no real title available?)
• Normalisers of primitive permutation groups in quasipolynomial time
• An Improvement of a Function Computing Normalizers for Permutation Groups

This page was built for publication: Computing normalizers of permutation groups efficiently using isomorphisms of association schemes

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