The $3$-closure of a solvable permutation group is solvable
Preprint
Abstract
Let $m$ be a positive integer and let $\Omega$ be a finite set. The $m$-closure of $G\leq\operatorname{Sym}(\Omega)$ is the largest permutation group on $\Omega$ having the same orbits as $G$ in its induced action on the Cartesian product $\Omega^m$. The $1$-closure and $2$-closure of a solvable permutation group need not be solvable. We prove that the $m$-closure of a solvable permutation group is always solvable for $m\geq3$.
Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Regular orbits of finite primitive solvable groups, IIIJournal of Algebra, 2022
- Counterexamples to Two Conjectures in the Kourovka NotebookAlgebra and Logic, 2019
- Regular orbits of finite primitive solvable groups, IIJournal of Algebra, 2011
- Regular orbits of finite primitive solvable groupsJournal of Algebra, 2010
- THE CARTER SUBGROUPS OF SOME CLASSICAL GROUPSBulletin of the London Mathematical Society, 2004
- Two-closure of odd permutation group in polynomial timeDiscrete Mathematics, 2001
- The Magma Algebra System I: The User LanguageJournal of Symbolic Computation, 1997
- The Minimal Base Size of Primitive Solvable Permutation GroupsJournal of the London Mathematical Society, 1996
- Closures of Finite Primitive Permutation GroupsBulletin of the London Mathematical Society, 1992
- On the 2-Closures of Finite Permutation GroupsJournal of the London Mathematical Society, 1988