An Improvement of a Function Computing Normalizers for Permutation Groups

DOI10.1007/978-3-642-15582-6_13MaRDI QIDQ5747860zbMATH OpenOpenAlexFDO

Authors Izumi Miyamoto

Publication date 14 September 2010

Published in Mathematical Software – ICMS 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-15582-6_13

zbMATH Keywords

association schemescomputation of normalizersnormalizerspermutation groupsprimitive groupssymmetric groups

Mathematics Subject Classification ID

Primitive groups (20B15) Subgroups of symmetric groups (20B35) Symbolic computation and algebraic computation (68W30)

Recommendations

• An improvement of GAP normalizer function for permutation groups
• The computation of normalizers in permutation groups
• Computing normalizers in permutation groups
• scientific article; zbMATH DE number 1263405
• A method for the computation of normalizers in permutation groups with applications to the construction of primitive groups
• Normalizers of primitive permutation groups
• Computing normalizers of permutation groups efficiently using isomorphisms of association schemes
• An improvement to the centralizer algorithm for permutation groups
• scientific article; zbMATH DE number 2151233
• A unified approach to computations with permutation and matrix groups.

Cited in

(5)

• Computing normalisers of intransitive groups
• 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
• Normalizer calculation using automorphisms.
• Computation of isomorphisms of coherent configurations

This page was built for publication: An Improvement of a Function Computing Normalizers for Permutation Groups

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