Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T19:29:11.650Z Has data issue: false hasContentIssue false

Solvability of a Class of Rank 3 Permutation Groups1)

Published online by Cambridge University Press:  22 January 2016

D.G. Higman*
Affiliation:
Department of Mathematics, University of Michigan, Ann Arbor, Michigan
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.

1. Introduction. Let G be a rank 3 permutation group of even order on a finite set X, |X| = n, and let Δ and Γ be the two nontrivial orbits of G in X×X under componentwise action. As pointed out by Sims [6], results in [2] can be interpreted as implying that the graph = (X, Δ) is a strongly regular graph, the graph theoretical interpretation of the parameters k, l, λ and μ of [2] being as follows: k is the degree of , λ is the number of triangles containing a given edge, and μ is the number of paths of length 2 joining a given vertex P to each of the l vertices ≠ P which are not adjacent to P. The group G acts as an automorphism group on and on its complement = (X,Γ).

Information

Type
Research Article
Copyright
Copyright © Editorial Board of Nagoya Mathematical Journal 1971