Closures of permutation groups with restricted nonabelian composition factors
Open Access
- 1 July 2025
- journal article
- Published by World Scientific Pub Co Pte Ltd in Bulletin of Mathematical Sciences
- Vol. 15 (02)
Abstract
Given a permutation group G on a finite set [ ], let [ ] denote the k-closure of G, that is, the largest permutation group on [ ] having the same orbits in the induced action on [ ] as G. Recall that a group is [ ]-free if it does not contain a section isomorphic to the alternating group of degree d. Motivated by some problems in computational group theory, we prove that the k-closure of an [ ]-free group is again [ ]-free for [ ] and [ ].Keywords
All Related Versions
Funding Information
- Russian Science Foundation (24-11-00127)
- Russian Science Foundation (24-11-00127)
This publication has 25 references indexed in Scilit:
- The Closures of Wreath Products in Product ActionAlgebra and Logic, 2021
- Two-closures of supersolvable permutation groups in polynomial timecomputational complexity, 2020
- The base size of a primitive diagonal groupJournal of Algebra, 2013
- Asymptotic Results for Primitive Permutation GroupsJournal of Algebra, 1997
- Permutation Groups1996
- Graph isomorphism problem and 2-closed permutation groupsApplicable Algebra in Engineering, Communication and Computing, 1994
- On the maximal subgroups of the finite classical groupsInventiones Mathematicae, 1984
- On the orders of primitive groups with restricted nonabelian composition factorsJournal of Algebra, 1982
- Isomorphism of graphs of bounded valence can be tested in polynomial timeJournal of Computer and System Sciences, 1982
- A polynomial bound for the orders of primitive solvable groupsJournal of Algebra, 1982