OpenSIUC

Title

Cyclic Permutations in Doubly-Transitive Groups

Authors

John P. McSorley, Southern Illinois University CarbondaleFollow

Comments

Published in Communications in Algebra, 25(1), 33-35.

Abstract

Let Ω be a finite set of size n. A cyclic permutation on Ω is a permutation whose cycle decomposition is one cycle of length n. This paper classifies all finite doubly-transitive permutation groups which contain a cyclic permutation. The classification appears in Table 1.

We use (G, Ω) for a finite doubly-transitive permutation group G acting on a finite set Ω. For other notation and definitions see the self-contained article Cameron [1].