Towards efficient normalizers of primitive groups

DOI10.1007/978-3-030-52200-1_10MaRDI QIDQ5039561zbMATH OpenOpenAlexFDO

Authors Sergio Siccha

Publication date 13 October 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

normalizerspermutation group algorithmsprimitive groups

Mathematics Subject Classification ID

Computational methods for problems pertaining to group theory (20-08) General theory for finite permutation groups (20B05) Primitive groups (20B15) Symbolic computation and algebraic computation (68W30)

Abstract: We present the ideas behind an algorithm to compute normalizers of primitive groups with non-regular socle in polynomial time. We highlight a concept we developed called permutation morphisms and present timings for a partial implementation of our algorithm. This article is a collection of results from the author's PhD thesis.

Recommendations

• A method for the computation of normalizers in permutation groups with applications to the construction of primitive groups
• scientific article; zbMATH DE number 475352
• scientific article; zbMATH DE number 1263405
• Primitive normalisers in quasipolynomial time
• scientific article; zbMATH DE number 2151233

Cites work

• A method for the computation of normalizers in permutation groups with applications to the construction of primitive groups
• A unifying method for the design of algorithms canonizing combinatorial objects
• Computing chief series, composition series and socles in large permutation groups
• Computing in Permutation and Matrix Groups II: Backtrack Algorithm
• Computing intersections and normalizers in soluble groups
• Computing normalizers in permutation groups
• Graph isomorphism in quasipolynomial time (extended abstract)
• scientific article; zbMATH DE number 4055862 (Why is no real title available?)
• scientific article; zbMATH DE number 46118 (Why is no real title available?)
• scientific article; zbMATH DE number 894528 (Why is no real title available?)
• scientific article; zbMATH DE number 3399470 (Why is no real title available?)
• Julia
• Julia: a fresh approach to numerical computing
• Normalizer calculation using automorphisms.
• Normalizers of primitive permutation groups
• Normalizes and permutational isomorphisms in simply-exponential time
• Permutation group algorithms based on directed graphs
• Permutation group algorithms based on partitions. I: Theory and algorithms
• Polynomial-time normalizers
• Practical graph isomorphism. II.
• recog
• The computation of normalizers in permutation groups
• The Inclusion Problem for Finite Primitive Permutation Groups
• The Magma algebra system. I: The user language

Cited in

(4)

• Primitive normalisers in quasipolynomial time
• Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
• A method for the computation of normalizers in permutation groups with applications to the construction of primitive groups
• Normalisers of primitive permutation groups in quasipolynomial time

Describes a project that uses

Uses Software

• GAP
• Magma
• nauty
• Traces
• recog
• Julia
• GraphBacktracking

This page was built for publication: Towards efficient normalizers of primitive groups

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