Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
THEOREMS OF RIETZ AND WIELANDT ON TRANSITIVE PERMUTATION GROUPS PETER M. NEUMANN 1. The context The theorems of Rietz (1904) and Wielandt (1962) that are to be extended in this note deal with a permutation group G acting transitively on a finite set Q. They give information about the behaviour of a stabiliser G of a point a of Q. RIETZ'S THEOREM [1, Theorem 10]. Suppose that G is primitive on ft and is finite of odd order. If G has just two orbits T and A in ft — {a}, then the action ofG on F is a a faithful. Recall that there is a natural pairing of G -in variant subsets of ft. It was originally discovered by Burnside in 1901, and, as was pointed out by Manning in 1927, may be described as a process of 'reflection' (see [3, §16]): if F is such a set we define K:={geG\a.€rg} and then define the reflection F* to be <xK, that is, {<xg\geK}. Another description, often more convenient, depends on the simple fact that there is a one-one correspondence between (/-invariant binary relations on ft (identified with subsets of ft x ft) and C? -invariant subsets of ft,
Bulletin of the London Mathematical Society – Wiley
Published: Jul 1, 1992
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.