加载中…
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 .

生成讲解博客的中文版本

生成AI智能校验的中文版本