On computing the closures of solvable permutation groups

DOI10.1142/s0218196724500036arXiv2304.02817MaRDI QIDQ6195309

Andrey V. Vasilev, Ilya Nikolaevich Ponomarenko

Publication date: 13 March 2024

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

permutation groupclosurepolynomial-time agorithm

Mathematics Subject Classification ID

Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Invariant relations and Aschbacher classes of finite linear groups.
• Two-closures of supersolvable permutation groups in polynomial time
• On the orders of primitive groups with restricted nonabelian composition factors
• Graph isomorphism problem and \(2\)-closed permutation groups
• The closures of wreath products in product action
• On finite totally \(2\)-closed groups
• The 3-closure of a solvable permutation group is solvable
• Structure of \(k\)-closures of finite nilpotent permutation groups
• 2-closures of primitive permutation groups of holomorph type
• Tensor products of coherent configurations
• Factoring Groups Efficiently
• On the 2-Closures of Finite Permutation Groups
• Closures of Finite Primitive Permutation Groups
• Permutation Groups and Cartesian Decompositions
• Two-closure of odd permutation group in polynomial time