On short expressions for cosets of permutation subgroups
DOI10.1007/S00026-021-00535-6OpenAlexW2807655072MaRDI QIDQ2033478FDOQ2033478
Authors: Daniele Dona 
Publication date: 17 June 2021
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.12031
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Subgroups of symmetric groups (20B35) General structure theorems for groups (20E34)
Cites Work
- The Finite Simple Groups
- A Remark on Stirling's Formula
- Title not available (Why is that?)
- Finite Permutation Groups and Finite Simple Groups
- Title not available (Why is that?)
- On the order of uniprimitive permutation groups
- Faster canonical forms for primitive coherent configurations (extended abstract)
- Isomorphism of graphs of bounded valence can be tested in polynomial time
- On the diameter of Cayley graphs of the symmetric group
- On the orders of primitive groups
- On the order of doubly transitive permutation groups
- On the orders of doubly transitive permutation groups, elementary estimates
- Graph isomorphism in quasipolynomial time (extended abstract)
- Effective bounds for certain functions concerning prime numbers
- Graph isomorphisms in quasi-polynomial time [after Babai and Luks, Weisfeiler-Leman,\ldots]
Cited In (2)
This page was built for publication: On short expressions for cosets of permutation subgroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2033478)
