Towards Efficient Normalizers of Primitive Groups
From MaRDI portal
Publication:5039561
DOI10.1007/978-3-030-52200-1_10zbMath1503.20001arXiv2005.04979MaRDI QIDQ5039561
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
68W30: Symbolic computation and algebraic computation
20B15: Primitive groups
20B05: General theory for finite permutation groups
20-08: Computational methods for problems pertaining to group theory
Related Items
Uses Software
Cites Work
- 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]
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item