Towards Efficient Normalizers of Primitive Groups

DOI10.1007/978-3-030-52200-1_10zbMath1503.20001arXiv2005.04979OpenAlexW3046731638MaRDI QIDQ5039561

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

normalizersprimitive groupspermutation group algorithms

Mathematics Subject Classification ID

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

Related Items (1)

Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• recog
• Julia
• Normalizers of primitive permutation groups
• Computing intersections and normalizers in soluble groups
• The computation of normalizers in permutation groups
• Permutation group algorithms based on partitions. I: Theory and algorithms
• The Magma algebra system. I: The user language
• Computing chief series, composition series and socles in large permutation groups
• Permutation group algorithms based on directed graphs
• Practical graph isomorphism. II.
• Julia: A Fresh Approach to Numerical Computing
• Computing in Permutation and Matrix Groups II: Backtrack Algorithm
• Computing normalizers in permutation groups
• The Inclusion Problem for Finite Primitive Permutation Groups
• Normalizes and permutational isomorphisms in simply-exponential time
• A unifying method for the design of algorithms canonizing combinatorial objects
• Graph isomorphism in quasipolynomial time [extended abstract]

This page was built for publication: Towards Efficient Normalizers of Primitive Groups