Normalizer calculation using automorphisms.

zbMATH Open1184.20002MaRDI QIDQ3545337FDOQ3545337

A. Hulpke

Publication date: 10 December 2008

zbMATH Keywords

finite permutation groupsautomorphism group computationsbacktrack searchescomputing centralizerscomputing normalizersnormalizer algorithms

Mathematics Subject Classification ID

General theory for finite permutation groups (20B05) Subgroups of symmetric groups (20B35)

Cited In (6)

• Computing normalisers of intransitive groups
• Fast computation of the centralizer of a permutation group in the symmetric group
• Towards Efficient Normalizers of Primitive Groups
• The computation of normalizers in permutation groups
• A method for the computation of normalizers in permutation groups with applications to the construction of primitive groups
• An application of Lie groupoids to a rigidity problem of 2-step nilmanifolds

   Recommendations

• Title not available (Why is that?) 👍 👎
• The computation of normalizers in permutation groups 👍 👎
• Title not available (Why is that?) 👍 👎
• An Improvement of a Function Computing Normalizers for Permutation Groups 👍 👎
• Computing normalisers of intransitive groups 👍 👎

This page was built for publication: Normalizer calculation using automorphisms.

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