The 3-closure of a solvable permutation group is solvable

Abstract

Let m be a positive integer and let be a finite set. The m-closure of G≤Sym() is the largest permutation group on having the same orbits as G in its induced action on the Cartesian product 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≥3.

0

Discussion (0)

Sign in to join the discussion.

Loading comments…