Set-Transitive Permutation Groups

Abstract

The concept of an s-ply transitive (1 ≤ s ≤ n) permutation group on n symbols is of considerable importance in the classical theory of finite permutation groups, which was in the height of its development in the period around the turn of the century. The obvious generalization to a permutation group which is s set-transitive (i.e., a group which, for each pair of s-element unordered subsets S, T of the given n symbols, contains a permutation which carries S into T) seems to have received little attention.