Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-12T22:51:29.952Z Has data issue: false hasContentIssue false

Set-Transitive Permutation Groups

Published online by Cambridge University Press:  20 November 2018

R. A. Beaumont
Affiliation:
University of Washington
R. P. Peterson
Affiliation:
University of Washington
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1955