Normalisers of primitive permutation groups in quasipolynomial time
From MaRDI portal
Publication:5112525
DOI10.1112/blms.12330MaRDI QIDQ5112525
Sergio Siccha, Colva M. Roney-Dougal
Publication date: 29 May 2020
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.01377
20B15: Primitive groups
Related Items
Primitive normalisers in quasipolynomial time, Comparing the order and the minimal number of generators of a finite irreducible linear group, Base sizes of primitive permutation groups, Computing normalisers of intransitive groups, Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Normalizers of primitive permutation groups
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- A proof of Pyber's base size conjecture
- Base sizes of primitive groups: bounds with explicit constants
- On the orders of primitive groups
- Minimal and random generation of permutation and matrix groups.
- Normalizes and permutational isomorphisms in simply-exponential time
- Graph isomorphism in quasipolynomial time [extended abstract]