Two-closure of rank 3 groups in polynomial time

DOI10.1016/J.JALGEBRA.2023.04.034zbMATH Open1523.20002arXiv2202.03746OpenAlexW4376256713MaRDI QIDQ6170785FDOQ6170785

Authors: Saveliĭ Vyacheslavovich Skresanov 

Publication date: 10 August 2023

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

Abstract: A finite permutation group $G$ on $Omega$ is called a rank 3 group if it has precisely three orbits in its induced action on $OmegaimesOmega$. The largest permutation group on $Omega$ having the same orbits as $G$ on $OmegaimesOmega$ is called the 2-closure of $G$. We construct a polynomial-time algorithm which given generators of a rank 3 group computes generators of its 2-closure.

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

Recommendations

• The 2-closure of a \(\frac{3}{2}\)-transitive group in polynomial time
• Two-closure of odd permutation group in polynomial time
• On primitive 2-closed permutation groups of rank at most four
• Graph isomorphism problem and \(2\)-closed permutation groups
• 2-closures of primitive permutation groups of holomorph type

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees
• The Finite Simple Groups
• Title not available (Why is that?)
• Base size, metric dimension and other invariants of groups and graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finite Permutation Groups and Finite Simple Groups
• The Rank 3 Permutation Representations of the Finite Classical Groups
• Recognizing Hamming graphs in linear time and space
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• The isomorphism problem for classes of graphs closed under contraction
• Generators for Simple Groups
• 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
• Generation of almost simple groups
• The Affine Permutation Groups of Rank Three
• Title not available (Why is that?)
• Two-closure of odd permutation group in polynomial time
• Title not available (Why is that?)
• Computing the structure of finite algebras
• Title not available (Why is that?)
• The Finite Primitive Permutation Groups of Rank Three
• Polynomial-time normalizers
• Sylow's theorem in polynomial time
• A note on the graph isomorphism counting problem
• Graph isomorphism problem and \(2\)-closed permutation groups
• The 2-closure of a \(\frac{3}{2}\)-transitive group in polynomial time
• Two-closures of supersolvable permutation groups in polynomial time
• Title not available (Why is that?)
• Strongly regular graphs
• Isomorphism of planar graphs (working paper)
• Computing the order of centralizers in linear groups
• Matrix generators for the orthogonal groups
• Partial linear spaces with a rank 3 affine primitive group of automorphisms
• On 2-closures of rank 3 groups

Cited In (5)

• The 2-closure of a \(\frac{3}{2}\)-transitive group in polynomial time
• On computing the closures of solvable permutation groups
• Two-closures of supersolvable permutation groups in polynomial time
• Graph isomorphism problem and \(2\)-closed permutation groups
• Two-closure of odd permutation group in polynomial time

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170785)