PRIMITIVE PERMUTATION GROUPS CONTAINING A CYCLE

By Gareth Aneurin Jones. Bulletin of the Australian Mathematical Society, 2012

75 citations recorded by the source corpus.

Abstract The primitive finite permutation groups containing a cycle are classified. Of these, only the alternating and symmetric groups contain a cycle fixing at least three points. This removes a primality condition from a classical theorem of Jordan. Some applications to monodromy groups are given, and the contributions of Jordan and Marggraff to this topic are briefly discussed.

Subfields: Artificial Intelligence, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/c19bd895e02f6a0b5d71ef36589766e779baa4bc

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Ben Steinberg
2. Peter J. Cameron

In Discrete Mathematics and Combinatorics

1. Ben Steinberg
2. Peter J. Cameron
3. Leandro Vendramin

In Electrical and Electronic Engineering

1. Ben Steinberg
2. Peter J. Cameron

Citations in the corpus

• Between primitive and 2-transitive: Synchronization and its friends (2015, background): “The primitive groups containing a cycle have been classified by Gareth Jones [67].”