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.
ALAN R. PRINCE The purpose of this paper is to prove the following theorem. THEOREM. Let G be a finite group of collineations of a finite projective plane & of order n. Let the number of regular point orbits be k. Then n<\G\ + V\G\(\G\+k). Proof. Let / denote the permutation character of G in its action on the points of the plane. Then the number N of orbits of G in this action is given by the following formula, due to Frobenius: . An orbit is regular if its length is |G|. An orbit which is not regular has length ThuS = ±\G\(N+k). (1) If geG, the fixed points and fixed lines of g form a substructure of & [1]. If g does not fix a subplane of ^ , then all its fixed points, except for perhaps one, lie on a line. Thus x(g) ^n + 2. If g ^ 1 and g fixes a subplane of order m, then by a theorem of 2 2 2 R. H. Bruck (see [2]) either n = m or « ^ m + m. In either event, n ^ m . Thus Xig) < « + V«+1 - Clearly,
Bulletin of the London Mathematical Society – Wiley
Published: Mar 1, 1988
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.