Abstract
Let be a positive integer and let be a finite set. The -closure of is the largest permutation group on having the same orbits as in its induced action on the Cartesian product . The -closure and -closure of a solvable permutation group need not be solvable. We prove that the -closure of a solvable permutation group is always solvable for .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.