Two-closure of rank \(3\) groups in polynomial time

DOI10.1016/j.jalgebra.2023.04.034zbMath1523.20002arXiv2202.03746OpenAlexW4376256713MaRDI QIDQ6170785

Saveliĭ Vyacheslavovich Skresanov

Publication date: 10 August 2023

Published in: Journal of Algebra (Search for Journal in Brave)

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

zbMATH Keywords

permutation grouppolynomial timerank \(3\)\(2\)-closure

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Software, source code, etc. for problems pertaining to group theory (20-04) General theory for finite permutation groups (20B05)

Cites Work

• Recognizing Hamming graphs in linear time and space
• Two-closures of supersolvable permutation groups in polynomial time
• Sylow's theorem in polynomial time
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• Computing the order of centralizers in linear groups
• The isomorphism problem for classes of graphs closed under contraction
• On construction and identification of graphs. With contributions by A. Lehman, G. M. Adelson-Velsky, V. Arlazarov, I. Faragev, A. Uskov, I. Zuev, M. Rosenfeld and B. Weisfeiler
• A note on the graph isomorphism counting problem
• Matrix generators for the orthogonal groups
• Graph isomorphism problem and \(2\)-closed permutation groups
• Generation of almost simple groups
• The 2-closure of a \(\frac{3}{2}\)-transitive group in polynomial time
• Computing the structure of finite algebras
• Base size, metric dimension and other invariants of groups and graphs
• Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
• Generators for Simple Groups
• Partial linear spaces with a rank 3 affine primitive group of automorphisms
• The Finite Simple Groups
• The Rank 3 Permutation Representations of the Finite Classical Groups
• The Finite Primitive Permutation Groups of Rank Three
• The Affine Permutation Groups of Rank Three
• Finite Permutation Groups and Finite Simple Groups
• Isomorphism of Planar Graphs (Working Paper)
• On 2-closures of rank 3 groups
• Strongly Regular Graphs
• Two-closure of odd permutation group in polynomial time
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two-closure of rank \(3\) groups in polynomial time