GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1

D. FROHARDT, R. GURALNICK, K. MAGAARD

Contents
1. Introduction 1
1.1. Statement of results 3
2. Preliminary results 8
2.1. Notation 8
2.2. Lemmas on indices 8
3. Linear groups 12
3.1. Maximal subgroups of G 12
3.2. q = 7 or 8 13
3.3. Actions of type P 14
3.4. Other actions 18
4. Unitary groups 21
5. Exceptional groups 24
6. Multiple components 24
7. Genus 0 groups in positive characteristic 25
References 25
8. Appendix: Tables of indices 27
1. Introduction
Let : X P
1
be a cover of the Riemann sphere P
1
= C of nite degree
N, with branch points p
1
, . . . , p
r
. By g(X) we denote the genus of the compact
Riemann surface X. The monodromy group G of the cover is the image in S
N
of the fundamental group of P
1
p
1
, . . . , p
r
obtained by pathlifting over a base
point p
0
of P
1
p
1
, . . . , p
r
. This setup translates to the following group theoretic
situation:
x
1
, . . . , x
r
S
N
satisfying
(1)

r
i=1
x
i
= 1.
(2) G = x
1
, . . . , x
r
) is a transitive subgroup of S
N
, the monodromy group of
.
(3) Riemann-Hurwitz formula
2(N +g(X) 1) =
r

i=1
Ind(x
i
),
where Ind(x
i
) = N # cycles x
i
.
1
2 D. FROHARDT, R. GURALNICK, K. MAGAARD
Now Riemanns Existence Theorem asserts that modulo equivalence covers of P
1
of
degree n, unramied outside p
1
, . . . , p
r
are in one to one correspondence to tuples
(x
1
, . . . , x
r
) in S
N
satisfying 1-3 modulo conjugation.
In [12] Guralnick and Thompson asked to what extent the genus of X restricts
the structure of the monodromy group G? They made the following
Conjecture: [Guralnick-Thompson, 1990]
Fix g 0. There are only nitely many nonabelian simple groups except alternating
groups that can occur as a composition factor of the monodromy group of a genus
g cover of the Riemann sphere.
One can ask the analagous question for curves in positive characteristic. See the
nal section for a discussion of the current situation there.
Based on the original paper of Guralnick-Thompson [12], and on Guralnick [9],
Guralnick-Neubauer [11], Aschbacher [1], Shih [20], Liebeck-Saxl [14], and Liebeck-
Shalev [15] this was proved by Frohardt-Magaard in [5]
We are particularly interested in the case g = 0. In this case X is another copy
of the sphere, and : P
1
P
1
becomes a rational function. Each rational function
f is the composition of indecomposable functions f
i
, and moreover the monodromy
group of f is built up from the monodromy groups of the f
i
, see [12]. We are thus
reduced to the indecomposable case.
If is indecomposable, then G is a primitive permutation group of degree N.
Generically, G is the full symmetric group S
N
or alternating group A
N
. We say
is of non-generic type if G is not S
N
or A
N
.
At this point we feel that a realistic goal is to classify all equivalence classes
of primitive non-generic genus zero covers of P
1
. In this paper we classify all
equivalence classes of primitive genus zero covers of P
1
with the property that
some component (that is a subnormal quasi-simple subgroup) of the monodromy
group is Lie type group of rank one. We have two reasons for considering this case
here. For one many of the examples of non-generic exceptional genus zero covers of
P
1
have such components. For another this case has the right degree of complexity
to serve as an illustration and for the classication of all primitive non-generic genus
zero covers of P
1
. For monodromy groups with Lie type components this is now
being undertaken by the authors, and for monodromy groups with alternating type
components, by Guralnick-Shareshian.
Our proof is group theoretic. By a series of reductions, which we will now
describe, we are able to center our analysis on the case where G is almost simple;
that is that G contains a nonabelian simple normal subgroup S such that C
G
(S) =
1). As in [12] our starting point is the Aschbacher-ONan-Scott theorem which
describes the general structure of a primitive permutation group. The Aschbacher-
ONan-Scott theorem asserts that if G is a primitive subgroup of S
n
with point
stabilizer M, thenM is maximal and G contains a characteristic subgroup F

(G)
which is either an elementary abelian p-group, or a direct product of isomorphic
simple groups. Moreover M lies in one of ve types of positions relative to F

(G).
The papers of Aschbacher [1], Guralnick-Thompson [12] and Shih [20] show that
only two of these situations can lead to genus zero composition composition factors
other than the alternating group of degree ve. These are
GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1 3
(1) F

(G) = F
s
p
, and G is the semidirect product of F
s
p
with M. (The ane
case)
(2)
F

(G) = L
1
L
t
,
with isomorphic nonabelian simple groups L
i
(called components) and
M F

(G) = M
1
M
t
,
with M
i
< L
i
, with all M
i
isomorphic. (The product case)
Combining the results of [12], [19] and [18] we see that sections of SL
6
(2) and
SL
4
(3) are the only possible primitive genus zero composition factors that can
occur in the ane case. Thus it suces to analyze the product case. Starting with
[9] and ending with [10] Guralnick establishes a strong reduction theorem to the
almost simple case.
We will now describe how we deal with the almost simple case. Let G be an
almost simple group of Lie type of rank 1 and M a maximal subgroup of G. We use
the Riemann-Hurwitz formula to dene the genus g(M, x
1
, . . . , x
r
) of a generating
system x
1
, . . . , x
r
of G, whose product is 1.
The minimum of g(M, x
1
, . . . , x
r
), taken over all subgroups M and all generating
sets of G whose product is 1, is called the minimum genus of G. Our task is to
compute the minimal genus of G.
Using lemma 2.2 and the classication of maximal subgroups we prove in lemma
3.2 respectively lemma 4.1 that the minimal genus G is usually achieved when M
is equal to a parabolic subgroup P of G; that is, P is the normalizer of a Sylow
p-subgroup of G where q is a power of the prime p. Now we follow the proof of
the Guralnick-Thompson conjecture in [5] to eliminate those tuples x
1
, . . . , x
r
of G
and maximal subgroups M for which
1
[G:M]

r
i=1
Ind(x
i
) 2. For the remaining
tuples we decide which of these can indeed generate G. For small values of q this
was done by using the computer algebra system GAP [7]. Finally we use GAP [7]
to complete the analysis of those product cases with multiple components.
Assume throughout that is a primitive G-set with point stabilizer M and that
A = (x
i
) is an ordered r-tuple of elements of G

such that x
1
x
2
. . . x
r
= 1.
Denition: Set
(A, ) =

xX
ind(x)
and
g(G, M, A) =
1
2
(

xX
ind(x) 2[G : M] + 2)
where ind(x) is the index of x as a permutation of the right cosets of M.
1.1. Statement of results. Let G be a nite group, a transitive G-set, and
A = (x
1
, . . . , x
r
) an ordered r-tuple of elements of G 1. Assume the following
conditions.
(1) G = x
i
).
(2) x
1
x
2
. . . x
r
= 1.
(3)

Ind(x
i
) = 2[[ + 2g 2.
4 D. FROHARDT, R. GURALNICK, K. MAGAARD
These conditions say that A is a genus g system for G and G has a genus g action
on .
N = [[ = [G : M] where M is the stabilizer of a point.
Our purpose here is to determine all possible genus 0 actions and systems when
F

(G) is a product of groups of Lie type and Lie rank 1, none of which are at least
one of which is not isomorphic to an alternating group. Specically, we prove the
following theorems.
Theorem 1.1. Assume that F

(G)

= PSL(2, q), where either q > 9 or q 7, 8,
and that A is a genus 0 system of type d for G. Assume further that the stabi-
lizer of a point in the genus 0 action is isomorphic to M. Then the parameters
q, G, r, d, M, N associated with A appear in one of Tables 1, 2, or 3.
Theorem 1.2. Assume that F

(G)

= PSU(3, q) and that A is a genus 0 system
of type d for G. Assume further that the stabilizer of a point in the genus 0 action
is isomorphic to M. Then the parameters q, G, r, d, M, N associated with A appear
in one of Table 4.
Theorem 1.3. Assume that F

(G) is an exceptional group of Lie rank 1 that is

not isomorphic to a classical group and that A is a genus 0 system of type d for
G. Assume further that the stabilizer of a point in the genus 0 action is isomorphic
to M. G

= Aut(Sz(8)), and A is of type (3, 3, 4), M is a parabolic subgroup, and
N = 65.
Theorem 1.4. Assume that F

(G) is not simple and that F

(G) is a product of
simple groups of Lie rank 1, at least one of them not isomorphic to L
2
(5) or L
2
(9).
If A is a genus 0 system of type d for G acting on N points, then one of the
following is true.
(1) G

= PSL(2, 7) / Z
2
, d = (2, 4, 14), and N = 49.
(2) G

= (PSL(2, 8) PSL(2, 8)).S
3
, d = (2, 3, 18), and N = 81.
(3) G

= (PSL(2, 8) PSL(2, 8)).S
3
, d = (2, 4, 6), and N = 81.
(4) G

= (PSL(2, 8) PSL(2, 8)).S
3
or PSL(2, 8).3 / Z
2
, d = (2, 3F, 2, 2), and
N = 81.
Notation in Tables 1, 2, 3.
G Let G
0
= PSL(2, q) and G
1
= PGL(2, q). For h > 1, let G
h
be the
extension of G
0
by a standard eld automorphism of order h. Let G
F
=
Aut(PSL(2, q)), the full automorphism group of G
0
. The other almost
simple groups of type L
2
(q) do not arise in the conclusion of Theorem 1.1.
d The type of A is given by an r-tuple d = (d
1
, d
2
, . . . , d
r
), where d
i
denotes
a type of element of G, according to the following scheme. For d > 2, and
also when q is even, PGL(2, q) contains a single class of cyclic subgroups
of order d. Let the integer d denote the set of all elements of order d in
G
1
in this situation. If d = 2 and q is odd, then there are two classes of
involutions in G
1
, denoted by 2A and 2B, where 2A is the class lying in G
0
.
The symbol dF, d an integer, represent elements of order d lying outside
G
0
. The symbol 4Fa, in PL(2, 25), represents the elements of order 4
that square to a 2A element in PSL(2, 5). The notation 8F
4
in PL(2, 16)
represents elements of order 8 that have order 4 mod G
0
.
GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1 5
Table 1. Genus 0 systems for groups of type L
2
(q), q = 7, 8
q G r d M N
7 G
0
6 (2A, 2A, 2A, 2A, 2A, 2A) S 7
5 (2A, 2A, 2A, 2A, 3) S 7
5 (2A, 2A, 2A, 2A, 4) S 7
4 (2A, 2A, 2A, 7) S 7
4 (2A, 2A, 3, 3) S 7
4 (2A, 2A, 3, 4) S 7
4 (2A, 2A, 4, 4) S 7
3 (2A, 3, 7) P, S 8, 7
3 (2A, 4, 7) S 7
3 (3, 3, 4) P, S 8, 7
3 (3, 3, 7) P 8
3 (3, 4, 4) S 7
3 (4, 4, 4) S 7
G
1
4 (2A, 2B, 2B, 3) P, T+, T 8, 28, 21
4 (2A, 2B, 2B, 4) T 21
4 (2B, 2B, 2B, 6) P 8
4 (2B, 2B, 3, 3) P 8
3 (2A, 6, 6) P 8
3 (2B, 3, 8) P, T+, T 8, 28, 21
3 (2B, 4, 6) P, T+, T 8, 28, 21
3 (2B, 4, 8) T 21
3 (2B, 6, 7) P 8
3 (3, 6, 6) P 8
8 G
0
3 (2, 2, 2, 3) T 28
3 (2, 3, 7) P, T+, T 9, 36, 28
3 (2, 3, 9) T 28
3 (2, 7, 7) P 9
G
F
4 (2, 3F, 3F, 3F) P 9
4 (2, 2, 3F, 3F) P 9
4 (3F, 3F, 3F, 3F) P 9
3 (2, 3F, 9F) P, T+, T 9, 36, 28
3 (2, 6F, 6F) P 9
3 (3, 3F, 6F) P 9
3 (3F, 3F, 9) P 9
3 (3F, 3F, 9F) P 9
3 (3F, 6F, 6F) P 9
3 (3F, 6F, 7) P 9
M Let P be a parabolic subgroup of G; that is, P is the normalizer of a Sylow
p-subgroup of G where q is a power of the prime p.
Let T
+
be the G-normalizer of a cyclic subgroup of G
0
of order (q 1)/2
or q 1 depending on whether q is odd or even.
Let T

be the G-normalizer of a cyclic subgroup of G

0
of order (q +1)/2
or q + 1.
6 D. FROHARDT, R. GURALNICK, K. MAGAARD
Table 2. Genus 0 systems for groups of type L
2
(q), 11 q 19
q G r d M N
11 G
0
5 (2A, 2A, 2A, 2A, 2A) A
5
11
4 (2A, 2A, 2A, 5) A
5
11
4 (2A, 2A, 2A, 6) A
5
11
4 (2A, 2A, 3, 3) A
5
11
3 (2A, 3, 11) A
5
11
3 (2A, 5, 5) P, A
5
12, 11
3 (2A, 5, 6) A
5
11
3 (2A, 6, 6) A
5
11
3 (3, 3, 5) A
5
11
3 (3, 3, 6) A
5
11
G
1
3 (2B, 3, 10) P, S
4
12, 55
3 (2B, 3, 12) S
4
55
3 (2B, 4, 5) P, T
+
, T

, S
4
12, 66, 55, 55
3 (2B, 4, 6) T

, S
4
55, 55
3 (2B, 5, 10) P 12
13 G
0
4 (2A, 2A, 2A, 3) P 14
3 (2A, 3, 7) P, T
+
, T

, A
4
14, 91, 78, 91
3 (2A, 3, 13) P 14
3 (2A, 6, 6) P 14
3 (3, 3, 6) P 14
G
1
3 (2A, 4, 12) P 14
3 (2B, 3, 12) P 14
3 (2B, 4, 6) P 14
3 (3, 4, 4) P 14
16 G
0
3 (2, 3, 15) P 17
G
2
3 (2, 4F, 6F) P, L 17, 68
3 (2, 6F, 6F) P 17
3 (2F, 4F, 15) P 17
G
F
3 (2, 4F
4
, 8F
4
) P 17
3 (2, 4F
4
, 12F
4
) P 17
3 (4F
2
, 4F
4
, 4F
4
) P 17
3 (4F
4
, 4F
4
, 6F
2
) P 17
17 G
0
3 (2A, 3, 8) P, S
4
18, 102
3 (2A, 4, 8) P 18
19 G
0
3 (2A, 3, 9) P, A
5
20, 57
3 (2A, 3, 10) A
5
57
G
1
3 (2B, 3, 18) P 20
Let L = C
G
(s) where s is a standard eld automorphism of smallest
possible order.
Let A
4
, A
5
, and S
4
denote maximal subgroups isomorphic, respectively,
to A
4
, A
5
, and S
4
.
Notation in Table 4.
GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1 7
Table 3. Genus 0 systems for groups of type L
2
(q), q > 19
q G r d M N
25 G
0
3 (3, 3, 4) P 26
3 (2A, 3, 12) P 26
G
1
3 (2B, 3, 8) P 26
G
2
3 (2A, 4Fa, 6F) P, L 26, 65
27 G
3
3 (2A, 3F, 9F) P 28
3 (3F, 3F, 6Fa) P 28
G
F
3 (2B, 3F, 12F) P 28
29 G
0
3 (2A, 3, 7) P, A
5
30, 203
31 G
1
3 (2B, 3, 10) P 32
32 G
F
3 (2, 5F, 5F) P 33
37 G
1
3 (2A, 3, 9) P 38
41 G
0
3 (2A, 4, 5) P 42
43 G
0
3 (2A, 3, 7) P 44
64 G
3
3 (2, 3F, 9F) P 65
Table 4. Genus 0 systems for groups of type U
3
(q), q = 3, 4, 5
q G r d M N
3 G
0
3 (2A, 6A, 7AB) F 36
3 (2A, 6A, 8AB) F 36
G
1
4 (2B, 2B, 2B, 4D) P 28
3 (2B, 3B, 12CD) P, F, N, B 28, 36, 63, 63
3 (2B, 4C, 12CD) F 36
3 (2B, 4D, 7AB) P, F, B 28, 36, 63
3 (2B, 4D, 12AB) P 28
4 G
1
3 (2B, 3A, 8AB) P, N 65, 208
5 G
0
3 (2A, 4A, 10A) A
7
50
3 (2A, 5B, 7AB) A
7
50
3 (2A, 5B, 8AB) A
7
50
G
1
4 (2A, 2B, 2B, 4A) A
7
50
3 (2B, 3A, 20AB) A
7
50
3 (2B, 4A, 8C) A
7
50
3 (2B, 4A, 10B) A
7
50
3 (2B, 4A, 12B) A
7
50
3 (2B, 6A, 6D) A
7
50
G Let G
0
= PSU(3, q) and G
1
= PL(3, q). The other almost simple groups
of type U
3
(q) do not arise in the conclusion of Theorem 1.2.
d We use Atlas notation. 7AB means, for example, the union of classes 7A
and 7B.
M P is a maximal parabolic subgroup of G.
F is a subgroup of U
3
(3) isomorphic to L
2
(7).
N is the G-stabilizer of a non-singular point in the natural module.
8 D. FROHARDT, R. GURALNICK, K. MAGAARD
B is the stabilizer of a base in U
3
(3).
A
7
is a subgroup of U
3
(5) isomorphic to A
7
.
Corollary 1.5. L
2
(q) is a genus 0 composition factor if and only if
q 2, 4, 5, 7, 8, 9, 11, 13, 16, 17, 19, 25, 27, 29, 31, 32, 37, 41, 43, 64.
Corollary 1.6. U
3
(q) is a genus 0 composition factor if and only if
q 3, 4, 5.
2. Preliminary results
Lemma 2.1. If (A, ) < 2[[ 2, then A is not a generating set for G.
Lemma 2.2. Assume that G acts 2-transitively on the set with point stabilizer
P. If M is a proper subgroup of G then one of the following is true.
(1) g(G, M, A) g(G, P, A)
(2) M acts transitively on the points of .
In particular, if g(G, P, A) > 0, then either g(G, M, A) > 0 or [G : P] [ [M[.
Proof. By assumption, 1
G
P
= 1
G
+ for some irreducible character of G. Let
f : X P
1
be a cover with X of genus g = g(G, P, A). Let Z denote the Riemann
surface corresponding to the Galois closure. So G acts on Z. Let Y = Z/M. If
V is the space of holomorphic dierentials on Z, then for any subgroup H of G,
g(Z/H) = g = g(G, H, A) is the dimension of the space of xed points of H on V .
Since Z/G = P
1
, G has no xed points on V . Thus, by Frobenius reciprocity, g is
the multiplicity of in V .
Now (1
G
M
, 1
G
P
) is the number of orbits of M on . Since the trivial character
occurs once in any transitive permutation character, it follows that either M is
transitive or occurs in 1
G
M
. Another application of Frobenius reciprocity shows
that in the latter case, the dimension of the space of M xed points on V is at least
that of P, whence the result. 2
Note that the proof actually shows that g(G, M, A) (c 1)g, where c is the
number of orbits of M on .
2.1. Notation. Let h(x) be the smallest positive integer h such that x
h
G
1
.
When h > 1, h [ d, and d/h ,= 2, let dF
h
denote the set of all elements x of order d
in G
F
with h(x) = h. If d/h = 2, let dF
h
a be the set of elements x of order d with
h(x) = h such that the involution x
h
lies in PSL(2, q) and dF
h
b be the set of such
elements with x
h
/ PSL(2, q).
Let h = h(G) be the exponent of G/G

.
Let Ind(x) be the index of the permutation x, and let Fix(x) be the number of
xed points of x.
2.2. Lemmas on indices.
Lemma 2.3. (Cauchy-Frobenius Formula) If x is a permutation of order d on a
set of order N, then Ind(x) = N
1
d

y
Fix(y), where the sum is over all y x).
Lemma 2.4. If x
1
, . . . , x
k
are representatives of the M-classes in x
G
M, then
Fix(x) =

[C
G
(x
i
) : C
M
(x
i
)].
GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1 9
Set
A(d) =

d
i
1
d
i
c(d) = A(d)/(A(d) 2)
Lemma 2.5. If Fix(x) A for all x G

, then
c(d)(A1) N 1.
The key consequence of the previous result is that c(d) must be large when the
xed point ratios are small. We record for future reference information about the
choices of d for which c(d) is large.
Lemma 2.6. One of the following is true.
(1) r 5 and c(d) 5.
(2) r 4 and c(d) 13.
(3) r = 3, d
1
= d
2
= 3, and d
3
5.
(4) r = 3, d
1
= 2, d
2
= 5, and d
3
7.
(5) r = 3, d
1
= 2, d
2
= 4, and d
3
11.
(6) r = 3, d
1
= 2, and d
2
= 3.
More specically, we have.
Lemma 2.7. One of the following is true of d.
(1) c(d) 25
(2) d = (2, 3, d) for some d with 7 d 11.
(3) d = (2, 4, 5).
Lemma 2.8. If G G
1
, then A(d) 85/42. If G , G
1
, then A(d) 49/24. If
[G : G
1
] > 2, then A(d) 37/18.
Let h = h(G) = [G : G G
1
].
Lemma 2.9. For every prime power divisor h

of h there exist two subscripts i

such that h

[ d
i
.
Proof. Every set } of r 1 elements of A must have the property that }) = G.
Therefore h = gcd(h(y) : y }) because G/G
1
is cyclic. It follows that for every
prime power divisor h

of h there is a y } with h

[ h(y). The statement now

follows because h(y) [ d(y). 2
Lemma 2.10. Suppose G has a genus 0 system on where [[ = N and
Fix(x)

A d = 2
B d > 2.
Then
(1) 21(A1) + 64(B 1) (N 1).
(2) If h 2, then 15(A1) + 34(B 1) (N 1).
(3) If h 3, then 9(A1) + 28(B 1) (N 1).
(4) If h = 4, then 7(A1) + 10(B 1) (N 1).
Proof.
10 D. FROHARDT, R. GURALNICK, K. MAGAARD
Step 1. Set
E(d) =

d
i
even
1
d
i
.
Also, set c
A
= c
A
(d) = E(d)/(A(d)2) and c
B
= c
B
(d) = (A(d)E(d))/(A(d)2).
Then
c
A
(A1) +c
B
(B 1) N 1.
Proof. The hypotheses imply that
Ind(x)

1
d
(N A) +
d2
d
(N B) d even
d1
d
(N B) d odd.
We have 2N 2 =

Indx
i
E(d)(N A) + (A(d) E(d))(N B).
Setting N

= N 1, A

= A 1, and B

= B 1, this implies that 2N

E(d)(N

) + (A(d) E(d))(N

) = A(d)N

E(d)A

(A(d) E(d))B

.
Therefore E(d)A

+(A(d) E(d))B

(A(d) 2)N

, and the conclusion follows.

2
To prove the lemma it suces to bound c
A
and c
B
in the various cases. In
particular, it suces to show that c
A
(d) 21 and and c
B
(d) 64 for all possible
choices of d and that (c
A
, c
B
) are respectively bounded by (15, 34), (9, 28), and
(7, 10), when h 2, h 3, and h = 4.
Partially order the collection of all ordered tuples by (d
1
, d
2
, . . . , d
r
) _ (d

1
, d

2
, . . . , d

r
)
if r r

and there is an injective map i i

from 1, . . . , r to 1, . . . , r

such
that d
i
d

i
for i = 1, . . . , r. Write d _
2
d

if, in addition, d

i
is even whenever d
i
is even.
Step 2. (1) If d _ d

then c(d

) c(d).
(2) If d _
2
d

then c
A
(d

) c
A
(d).
Step 3. c
B
64. If h = 2, then c
B
34. If h = 3, then c
B
28. If h = 4, then
c
B
10. If h 5, then c
B
21.
Proof. If d = (2, 3, 7), then c
A
(d) = 21 and c
B
(d) = 64. If d ,= (2, 3, 7), then
c
B
(d) c(d) 49.
If h = 2, then one of the following is true. d = (2, 3, 8), d = (2, 4, 5), (2, 3, 10) _ d,
(2, 4, 6) _ d, c(d) 13. Since c
B
(2, 3, 8) = 34, c
B
(2, 4, 5) = 26, c(2, 3, 10) = 31, and
c(2, 4, 6) = 25, the conclusion for h = 2 follows.
If h = 3, then one of the following is true. d = (2, 3, 9), (2, 3, 12) _ d, (3, 3, 4) _ d,
c(d) 13. Since c
B
(2, 3, 9) = 28, and c(2, 3, 12) = c(3, 3, 4) = 25, the conclusions
for h = 3 follow.
If h = 4, then one of the following is true. d = (2, 4, 4d) for some d > 1, d =
(3, 4, 4), (3, 4, 8) _ d, (4, 4, 4) _ d, (2, 2, 4, 4) _ d. We have A(2, 4, 4d) = (9d1)/4d
and E(2, 4, 4d) = (3d + 1)/4d. This implies that c
B
(2, 4, 4d) = 6 + 4/(d 1) 10.
Since c
B
(3, 4, 4) = 10, c(3, 4, 8) < c(3, 4, 6) = c(4, 4, 4) = 9, and c(2, 2, 4, 4) = 5, the
conclusions for h = 4 follow.
If h 5, then (2, 5, 5) _ d, whence c(d) c(2, 5, 5) = 21. 2
To complete the proof, it suces to bound c
A
.
Step 4. (1) c
A
(d) 21.
(2) If h = 2, then c
A
(d) 15.
(3) If h = 3, then c
A
(d) 9.
GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1 11
(4) If h = 4, then c
A
(d) 7.
(5) If h = 5, then c
A
(d) < 8.
(6) If h 6, then c
A
(d) 5.
Proof. If d ,= (2, 3, 7), then either c(d) 13 or d
0
_
2
d for some d
0
(2, 3, 8),
(2, 4, 5), (2, 4, 6), (3, 3, 4). Since c
A
(2, 3, 7) = 21, c
A
(2, 3, 8) = c
A
(2, 4, 5) = 15,
c
A
(2, 4, 6) = 11, and c
A
(3, 3, 4) = 3, the rst two statements now follow from
properties of _
2
.
If h = 3, then either c(d) < 9 or d
0
_
2
d for some d
0
(2, 3, 9), (2, 3, 12),
(2, 6, 6), (3, 3, 6), (3, 4, 6). Since c
A
(2, 3, 9) = 9, c
A
(2, 3, 12) = 7, c
A
(2, 6, 6) = 5,
and c
A
(3, 3, 6) = 1 the conclusions for h = 3 follow.
If h = 4, then d
0
_
2
d for some d
0
(2, 2, 4, 4), (2, 4, 8), (3, 4, 4), (4, 4, 4). Since
c(2, 2, 4, 4) = 5, c
A
(2, 4, 8) = 7, c
A
(3, 4, 4) = 3, and c
A
(4, 4, 4) = 3 the conclusions
for h = 4 follow.
If h = 5, then either d = (2, 5, 5) or (2, 5, 10), or (2, 10, 10) _
2
d. We have
c
A
(2, 5, 5) = 5, c
A
(2, 5, 10) = 3, and c(2, 10, 10) < 8, and the conclusion for h = 5
follows.
If h 6, then c
A
(d) c
A
(2, 6, 6) = 5. 2
2
The argument for the last step of the previous argument shows that c
A
(d) 12
for d / (2, 3, 7), (2, 3, 8), (2, 4, 5).
Lemma 2.11. Suppose h 2. In the notation of the previous proof, either
(1) d (2, 2, 2, 3), (2, 3, 8), (2, 3, 10), (2, 4, 5), (2, 4, 6); or
(2) c
A
(d) 7 and c
B
(d) 18.
Proof. Compute the pairs (c
A
, c
B
) for d = (2, 2, 2, 2, 2), (2, 2, 2, 4), (2, 2, 3, 3), (2, 3, 12),
(2, 4, 7), (2, 4, 8), (2, 5, 6), (2, 6, 6), (3, 4, 4), (4, 4, 4) to get, respectively, (5, 0), (7, 2),
(3, 4), (7, 18), (7, 12
2
3
), (7, 10), (5, 11), (3, 8), (3, 10), (3, 6). 2
Lemma 2.12. Suppose G has a genus 0 system on where [[ = N and
Fix(x)

d = 2 and x not a square

B

d > 2 or x a square.
If d ,= (2, 3, 7), in particular, if h 2, then 12(A

1) + 37(B

1) (N 1).
Proof. Assume that d ,= (2, 3, 7). Set
c
A
= c
A
(d) =
1
(A(d) 2)

d
i
2 (mod 4)
1
d
i
and c
B
= c
B
(d) = c(d) c
A
(d). Then c
A
A

+c
B
B

N.
If d ,= (2, 3, 8) or (2, 4, 5), then c
B
(d) c(d) 37, and, by the observation
above, c
A
(d) 12. It is a straightforward computation to verify that c
A
(2, 3, 8) =
12, c
B
(2, 3, 8) = 37, c
A
(2, 4, 5) = 10, and c
B
(2, 4, 5) = 31. The result follows. 2
Lemma 2.13. Suppose G has a genus 0 system on where [[ = N and
Fix(x)

A
3
d = 3
B
3
d ,= 3.
If h = 3, then 16(A
3
1) + 21(B
3
1) (N 1).
12 D. FROHARDT, R. GURALNICK, K. MAGAARD
Proof. Assume that h = 3.
Dene
c
A
3
= c
A
3
(d) =
1
(A(d) 2)

3 | d
i
2
d
i
and c
B
3
= c
B
3
(d) = c(d) c
A
3
(d). We need to show that c
A
3
16 and c
B
3
21.
It suces to assume that c(d) > 13. Therefore r = 3 and d
1
= 2 or 3. Either d =
(2, 3, 3k) for some k 3, or d (3, 3, 4), (3, 3, 5). It is straightforward to compute
that c
A
3
(2, 3, 3k) = 4 + 12/(d 2) 16 and c
B
3
(2, 3, 3k) = 9 + 12/(d 2) 21.
Also, c
A
3
(3, 3, 4) = 16, c
B
3
(3, 3, 4) = 9, c
A
3
(3, 3, 5) = 10, and c
B
3
(3, 3, 5) = 6. 2
Lemma 2.14. If h = 5 and F Fix(x) for all x G

, then 21(F 1) N 1.
Proof. We have A(d)
1
2
+ 2
4
5
= 21/10. Therefore c(d) 21. 2
Lemma 2.15. If h > 6 and F Fix(x) for all x G

, then 11(F 1) N 1.
Proof. It suces to show that A(d) 11/5. Either h is a prime power, in which
case, A(d)
1
2
+ 2
h1
h

1
2
+
12
7
= 31/14, or h 10, in which case A(d)
1
2
+
4
5
+
9
10
= 11/5. 2
3. Linear groups
3.1. Maximal subgroups of G. The following is well known cf [2].
Lemma 3.1. If M is a maximal subgroup of G, and M
0
= M G
0
, one of the
following is true.
(1) M = P, the normalizer of a Sylow p-subgroup of G.
(2) M = N(T

) where T

is a cyclic subgroup of G
0
of order (q 1)/2 when
q is odd or order q 1 when q is even.
(3) M
0

= A
4
, q 3 (mod 8), and either
(a) G = G
0
and q 2 (mod 5) or
(b) G = G
1
and M

= S
4
.
(4) M = M
0

= S
4
, G = G
0
, and q 1 (mod 8).
(5) M = M
0

= A
5
, G = G
0
, and q 1 (mod 10).
(6) L

= PGL(2, q
1/h
), h prime.
2
Lemma 3.2. If A is a genus 0 system for the action of G on the cosets of M, then
one of the following is true.
(1) A is a genus 0 system for the P-action of G.
(2) M acts transitively on G/P. In particular, q + 1 [ [M[ and either M =
N(T

) or one of the following is true

(a) q = 7, or 23, and M
0

= S
4
.
(b) q = 11, 19, 29, or 59 and M
0

= A
5
.
Proof. Since G is doubly transitive on G/P, it follows from Lemma 2.2 that either
g(G, G/P, A) g(G, G/M, A) or M is transitive on G/P. To establish the lemma
it remains only to show that the maximal subgroups listed are the only ones that
are transitive on the q + 1 points of the natural module for G.
Since T
+
has three orbits on G/P, it follows that N(T
+
) cannot be transitive.
GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1 13
If A
4
or S
4
is transitive on G/P, then q+1 [ 24, and q+1 > q 7, so q+1 = 8, 12,
or 24, whence q = 7, 11, or 23. However, L
2
(11) does not have a maximal subgroup
isomorphic to either A
4
or S
4
, so q = 7 or 23 in this case.
If A
5
is transitive on G/P, then q + 1 [ 60, and q + 1 > q 7, so q + 1 =
10, 12, 15, 20, 30, or 60, whence q = 11, 19, 29, or 59 because q ,= 9.
The subgroup L is not transitive on G/P for any choice of q. 2
3.2. q = 7 or 8.
Lemma 3.3. If A is a genus 0 system of type d for the P-action of PSL(2, 7) or
PGL(2, 7) then one of the following is true.
(1) G = PSL(2, 7) and d is one of the following.
(a) (2A, 3, 7)
(b) (3, 3, 4)
(c) (3, 3, 7)
(2) G = PGL(2, 7) and d is one of the following.
(a) (2A, 2B, 2B, 3)
(b) (2B, 2B, 2B, 6)
(c) (2B, 2B, 3, 3)
(d) (2A, 6, 6)
(e) (2B, 4, 6)
(f) (2B, 6, 7)
(g) (2B, 3, 8)
(h) (3, 6, 6)
Lemma 3.4. If A is a genus 0 system of type d for the P-action of PSL(2, 8) or
PL(2, 8) then one of the following is true.
(1) G = PSL(2, 8) and d is one of the following.
(a) (2, 3, 7)
(b) (2, 7, 7)
(2) G = PL(2, 8) and d is one of the following.
(a) (2, 2, 3F, 3F)
(b) (2, 3F, 3F, 3F)
(c) (3F, 3F, 3F, 3F)
(d) (2, 3F, 9F)
(e) (2, 6F, 6F)
(f) (3, 3F, 6F)
(g) (3F, 3F, 9F)
(h) (3F, 3F, 9)
(i) (3F, 6F, 6F)
(j) (3F, 6F, 7)
Proof. These follow from inspection of Tables 5 and 6.
Lemma 3.5. The group L(2, 8) is not generated by systems of the types (2, 2, 3F,
3F), (3F, 3F, 3F, 3F), (2, 6F, 6F), (3F, 6F, 6F), or (3F, 3F, 9).
2
Lemma 3.6. If A is a genus 0 system of type d for a non-P action of PSL(2, 7)
or PGL(2, 7), then one of the following is true.
14 D. FROHARDT, R. GURALNICK, K. MAGAARD
(1) G = PSL(2, 7) and one of the following is true.
(a) M = N(T
+
) and d = (2A, 3, 7).
(b) M = N(T

) and either d = (2A, 3, 7) or d = (2A, 4, 7).

(c) M = S
4
and d is one of the following
(i) (2A, 2A, 2A, 2A, 2A, 2A)
(ii) (2A, 2A, 2A, 2A, 3)
(iii) (2A, 2A, 2A, 2A, 4)
(iv) (2A, 2A, 2A, 7)
(v) (2A, 2A, 3, 3)
(vi) (2A, 2A, 3, 4)
(vii) (2A, 2A, 4, 4)
(viii) (2A, 3, 7)
(ix) (2A, 4, 7)
(x) (3, 3, 4)
(xi) (3, 4, 4)
(xii) (4, 4, 4)
(2) G = PGL(2, 7) and one of the following is true.
(a) M = N(T
+
) and either d = (2A, 2B, 2B, 3) or d = (2B, 3, 8).
(b) M = N(T

) and d is one of the following

(i) (2A, 2B, 2B, 3)
(ii) (2A, 2B, 2B, 4)
(iii) (2B, 3, 8)
(iv) (2B, 4, 6)
(v) (2B, 4, 8)
Proof. This follows from inspection of the table. Note that the action on the
cosets of S
4
shows that there are no generating systems of types (2A, 2A, 2A, 3)
or (2A, 2A, 2A, 2A, 2A). 2
Lemma 3.7. If A is a genus 0 system of type d for a non-P action of SL(2, 8) or
L(2, 8), then one of the following is true.
(1) G = SL(2, 8) and one of the following is true.
(a) M = N(T
+
) and d = (2, 3, 7).
(b) M = N(T

) and d = (2, 3, 7), (2, 3, 9) or (2, 2, 2, 3).

(2) G = L(2, 8), d = (2, 3F, 9F), and either M = N(T
+
) or M = N(T

).
3.3. Actions of type P. In this section, assume that M = P, and that x is an
element of order d in G

.
Lemma 3.8. (1) If x) G
1
,= 1, in particular, if x G
1
, then Fix(x) 2.
(2) If x G
F
, then Fix(x) q
1/d
+ 1.
Proof. If x G
1
, then the xed points of x are 1-dimensional eigenspaces of x),
where x GL(2, q) is in the preimage of x, so x xes at most two points. If
y x) G

1
, then Fix(x) Fix(y) 2, so we may assume that x) G
1
= 1 and
x is a standard eld automorphism, whence Fix(x) = q
1/d
+ 1. 2
Lemma 3.9. L
2
(q) has a generating system of type (2, 3, 7) if and only if one of
the following conditions holds.
(1) q is prime and q 1, 0, 1 (mod 7).
(2) q = p
3
where p is prime and p 2, 3, 4, 5 (mod 7).
GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1 15
Lemma 3.10. If d = (2, 3, 7), then q 7, 8, 13, 29, 43.
Proof. Let Fix(x
1
) = a, Fix(x
2
) = b, and Fix(x
3
) = c. We have I(x
1
) =
1
2
(q+1a),
I(x
2
) =
2
3
(q + 1 b), and I(x
3
) =
6
7
(q + 1 c), so
2q =

Ind(x
i
) =
85
42
(q+1)a/22b/36c/7 = 2q+
1
42
(q+8521a28b36c).
Therefore q = 21a + 28b + 36c 85. we have 0 a, b, c 2 and q + 1 Fix(x
i
)
(mod d
i
), for all i. Since q is a prime power, the congruences imply that at most one
value of a, b, c is 1. Since q is positive, the equality for q implies that a +b +c 3.
Of the 13 possible choices for (a, b, c), the choices (2, 1, 0), (2, 0, 1), and (1, 2, 0) yield
negative values for q, and the choices (2, 2, 2), (2, 1, 2), and (0, 1, 2) yield values of
q that are not prime powers. The remaining 7 choices of (a, b, c) yield values of
q as follows (2, 2, 0; 13), (2, 2, 1; 49), (2, 0, 2; 29), (1, 2, 2; 64), (1, 0, 2; 8), (0, 2, 2; 43),
(0, 2, 1; 7). It follows from Lemma 3.9 that q 7, 8, 13, 29, 43. 2
Lemma 3.11. One of the following is true.
(1) Ind(x)
d1
d
(q 1).
(2) x / G
1
and Ind(x)
d1
d
(q q
1/2
).
Proof. Ind(x) =
1
d
((d1)(q +1)

yx
Fix(y))
1
d
(d1)(q +1max(Fix(y))).
2
3.3.1. G G
1
.
Lemma 3.12. If A is a genus 0 system of type d for the P-action of G
0
or G
1
and q > 25, then one of the following is true.
(1) q = 29, G = G
0
, and d = (2A, 3, 7).
(2) q = 31, G = G
1
, and d = (2B, 3, 10).
(3) q = 37, G = G
0
, and d = (2A, 3, 9).
(4) q = 41, G = G
0
, and d = (2A, 4, 5).
(5) q = 43, G = G
0
, and d = (2A, 3, 7).
Proof. Assume that A = (x
1
, x
2
, . . . , x
r
) is a genus 0 system and that q > 25.
Then A(d) < 25/12 because c(d) q. By Lemma 2.7 it suces to consider systems
of types (2, 3, d), d 11 and (2, 4, 5). We have already considered (2, 3, 7) systems.
Step 1. If d = (2, 3, 8) and G G
1
, then q = 49.
Proof. Since G
1
has an element of order 8, it follows that q 1 (mod 8). We
have q c(d) = 49, so q 31, 41, 47, 49.
Suppose q 1 (mod 16). Then G G
0
, so Ind(x
i
) is even for all x
i
. Since
Ind(x
1
) =
1
2
(q + 1 Fix(x
1
)) it follows that Fix(x
1
) q + 1 (mod 4). Computing
indices, we have the following triples for the choices of q:
q = 31: (16, 20, 28)
q = 47: (24, 32, 42)
q = 49: (24, 32, 42)
It is apparent that the sum of the indices is 2q only when q = 49.
Suppose q = 41. Then q 7 (mod 16), so Ind(x
3
) is odd and Ind(x
1
) must
also be odd. It follows that Fix(x
1
) = 0. Computing indices, we have the index
triple (21, 28, 35), which is not valid. 2
Step 2. If d = (2, 3, 9) and G G
1
, then q = 37.
16 D. FROHARDT, R. GURALNICK, K. MAGAARD
Proof. We have q 1 (mod 9) and q c(d) = 37. Consequently q = 37. Ev-
idently Ind(x
1
) is even, and we have the index triple (18, 24, 32), which is indeed
valid. 2
Step 3. If d = (2, 3, 10) and G G
1
, then q = 31.
Proof. We have q 1 (mod 10) and q c(d) = 31. Consequently q = 29 or 31.
In either case, x
3
/ G
0
, and we have the following triples for the choices of q:
q = 29: (15, 20, 27)
q = 31: (15, 20, 27)
It is apparent that the sum of the indices is 2q only when q = 31. 2
Step 4. There is no system with d = (2, 3, 11).
Proof. Either 11 [ q or q 1 (mod 11). On the other hand, q c(d) < 31, and
there are no prime powers larger than 25 that satisfy these conditions. 2
Step 5. If d = (2, 4, 5), then q = 41.
Proof. We have q c(d) = 41. Because G has elements of orders 4 and 5, it follows
that q is odd and either 5 [ q or q 1 (mod 5). Therefore q 29, 31, 41. If
q 1 (mod 8), then Ind(x
2
) is even, and so consequently is Ind(x
1
). Otherwise
Ind(x
1
) and Ind(x
2
) are both odd. Computing indices, we have the following triples
for the choices of q:
q = 29: (15, 21, 24)
q = 31: (16, 24, 24)
q = 41: (20, 30, 32)
The genus of these systems is 0 only when q = 41. 2
Step 6. L
2
(49) does not have a (2A, 3, 8) generating system.
2
Lemma 3.13. If A is a genus 0 system of type d for the P-action of G
0
or G
1
and 11 q 25, then one of the following is true.
(1) q = 11 and either
(a) G = G
0
and d = (2A, 5, 5) or
(b) G = G
1
and d = (2B, 3, 10), (2B, 5, 10), or (2B, 4, 5).
(2) q = 13 and either
(a) G = G
0
and d = (2A, 2A, 2A, 3), (2A, 3, 7), (2A, 3, 13), (2A, 6, 6), or
(3, 3, 6).
(b) G = G
1
and d = (2A, 4, 12), (2B, 3, 12), (2B, 4, 6), or (3, 4, 4).
(3) q = 16, G = G
0
, and d = (2, 3, 15).
(4) q = 17, G = G
0
, and d = (2A, 3, 8) or (2A, 4, 8).
(5) q = 19 and either
(a) G = G
0
and d = (2A, 3, 9) or
(b) G = G
1
and d = (2B, 3, 18).
(6) q = 25 and either
(a) G = G
0
and d = (3, 3, 4) or
(b) G = G
1
and d = (2B, 3, 8).
Proof. By computation, we have the following.
GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1 17
Step 1. (1) L
2
(16) does not have a (2, 5, 5) or a (3, 3, 5) generating system.
(2) L
2
(25) does not have a (2A, 3, 12), a (2A, 4, 5), or a (2A, 4, 6) generating
system.
The statement in the lemma now follows from inspection of Tables 713 2
3.3.2. G , G
1
.
Lemma 3.14. Assume that A is a genus 0 system of type P, where G , G
1
. Then
one of the following is true.
(1) q = 8.
(2) q = 16 and either
(a) G = G
2
, and d = (2, 4F
2
, 6F
2
), (2, 6F
2
, 6F
2
), or (2F
2
, 4F
2
, 15) or
(b) G = G
F
, and d = (2, 4F
4
, 8F
4
), (2, 4F
4
, 12F
4
) or (4F
4
, 4F
4
, 6F
2
).
(3) q = 25, G = G
2
, and d = (2A, 4Fa, 6F).
(4) q = 27 and either
(a) G = G
3
and d = (2A, 3F, 9F) or
(b) G = G
F
and d = (2B, 3F, 12F).
(5) q = 32, G = G
F
, and d = (2, 5F, 5F).
(6) q = 64, G = G
3
, and d = (2, 3F, 9F).
Proof. Since we are specically excluding q = 4 and q = 9, we have that the rst
case holds whenever q < 16. Assume therefore that q 16.
Step 1. Set h = [G : G G
1
] and q
0
= q
1/h
. One of the following is true.
(1) h = 2 and q
0
13.
(2) h = 3 and q
0
4.
(3) h = 4 and q
0
3.
(4) h = 5 or 6 and q
0
= 2.
Proof. If h = 2, then q = q
2
0
12q
0
+ 37 by Lemma 2.12. Therefore q
0
< 16.
If h = 3, then q = q
3
0
16q
0
+ 21 by Lemma 2.13, so q
0
< 5. If h = 4, then
q = q
4
0
7q
1/2
+ 10q
1/4
= 7q
2
0
+ 10q
0
by Lemma 2.10, so q
0
< 4. If h = 5, then
q = q
5
0
21q
0
by Lemma 2.14, so q
0
< 5. If h = 6, then q 9q
1/2
+ 28q
1/3
by
Lemma 2.10. This implies that q
4
0
9q
0
+ 28, whence q
0
< 3.
If h > 6, then, by Lemma 2.15, q 11q
1/x
where x is the smallest prime divisor
of h. This implies that (q
1/x
)
x1
11 and q 11
x/(x1)
11
2
< 2
7
. This is not
possible because q q
h
0
2
7
. Therefore h 6 and one of the cases must hold. 2
Step 2. One of the following is true.
(1) q = 16, G = G
2
, and d = (2F, 2F, 2F, 2F, 2), (2F, 2F, 2F, 10F), (2F, 2F,
2, 5), (2F, 2F, 3, 3), (2F, 5, 10F), (2F, 6F, 15), (2, 4F
2
, 6F
2
), (2, 6F
2
, 6F
2
),
or (2F
2
, 4F
2
, 15).
(2) q = 16, G = G
F
, and d = (2F
2
, 2F
2
, 4F
4
, 4F
4
), (4F
4
, 4F
4
, 5), (4F
4
, 4F
4
, 4F
2
),
(4F
4
, 4F
4
, 6F
2
), (2, 4F
4
, 8F
4
), or (2, 4F
4
, 12F
4
).
(3) q = 25, G = G
2
, and d = (2A, 4Fa, 6F), (2F, 2F, 2A, 4), (2F, 2F, 2F, 6F),
(2F, 4, 10F), (2F, 5, 6F), (2F, 6, 6F), (2F, 4Fa, 12).
(4) q = 25, G = G
F
, and d = (2F, 4Fb, 8).
(5) q = 27, G = G
3
, and d = (2A, 3F, 9F) or (3F, 3F, 6Fa).
(6) q = 27, G = G
F
and d = (2B, 3F, 12F).
(7) q = 32, G = G
F
, and d = (2, 5F, 5F).
18 D. FROHARDT, R. GURALNICK, K. MAGAARD
(8) q = 49, G = G
2
and d = (2F, 2F, 2A, 3), (2F, 4Fa, 5), (2F, 4Fa, 6), or
(2F, 3, 14F).
(9) q = 64, G = G
2
and d = (2F
2
, 4F
2
, 5) or (2F
2
, 3, 14F
2
),
(10) q = 64, G = G
3
, and d = (2, 3F, 9F).
(11) q = 64, G = G
F
, and d = (2F
2
, 3F
3
, 18F
6
).
(12) q = 81, G = G
2
, and d = (2F
2
, 4, 6F
2
), (2F
2
, 3, 10F
2
).
(13) q = 121, G = G
2
, and d = (2F, 4Fa, 5), (2F, 3, 10F).
Proof. This follows from inspection of the tables for the groups with q = 16, 25, 27, 32, 49, 64, 81, 121, 169.
2
Step 3. (1) L
2
(16).2 does not have generating systems of the following types:
(2F, 2F, 2F, 2F, 2), (2F, 2F, 2F, 10F), (2F, 2F, 2, 5), (2F, 2F, 3, 3), (2F, 5, 10F),
(2F, 6F, 15).
(2) L
2
(16).4 does not have generating systems of the following types: (2F
2
, 2F
2
,
4F
4
, 4F
4
), (4F
4
, 4F
4
, 5).
(3) L
2
(25).2
2
does not have generating systems of the following types: (2F, 2F,
2A, 4), (2F, 2F, 2F, 6F), (2F, 4, 10F), (2F, 5, 6F), (2F, 6, 6F), (2F, 4Fa, 12).
(4) L
2
(25).2
2
does not have a generating system of type (2F, 4Fb, 8).
(5) L
2
(27).3 does not have a generating system of type (3F, 3F, 6Fa).
(6) L
2
(49).2
2
does not have generating systems of the following types: (2F, 2F,
2A, 3), (2F, 4Fa, 5), (2F, 4Fa, 6), (2F, 3, 14F).
(7) L
2
(64).2 does not have generating systems of the following types: (2F
2
, 4F
2
,
5), (2F
2
, 3, 14F
2
),
(8) L
2
(64).6 does not have a generating system of type (2F
2
, 3F
3
, 18F
6
).
(9) L
2
(81).2
2
does not have a generating system of type (2F
2
, 4, 6F
2
) or type
(2F
2
, 3, 10F
2
).
(10) L
2
(121).2
2
does not have a generating system of type (2F, 4Fa, 5) or type
(2F, 3, 10F).
3.4. Other actions. We rst consider actions of type L.
Lemma 3.15. If M is of type L and q > 9, then either
(1) q = 16 and d = (2, 4F
2
, 6F) or
(2) q = 25, G = G
2
, and d = (2A, 4Fa, 6F) or (2A, 4Fa, 6F

).
Proof. By Lemma 3.2 it suces to determine which genus 0 systems in the P-
action also have genus 0 in the L-action. If q = 16, then only such system is of
type (2, 4F
2
, 6F
2
). If q = 25, then only such system is of type (2A, 4Fa, 6F). The
only other values of q which have genus 0 systems in the P-action and maximal
subgroups of type L are q = 27 and q = 64. By inspection, the systems for these
groups do not have genus 0 in the L-action. 2
Lemma 3.16. Assume that G G
1
.
(1) If M = N(T

), then N = q(q +1)/2 and

Fix(x)

(q 1)/2 + 1 d = 2
1 d > 2
(2) If M G
0
= A
4
, then N = (q
3
q)/24 and
Fix(x)

(q + 1)/2 d = 2
(q + 1)/3 d > 2
GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1 19
(3) If M = S
4
and G = G
0
, then N = (q
3
q)/48 and
Fix(x)

3(q + 1)/8 d = 2
(q + 1)/6 d > 2
(4) If M = A
5
, then N = (q
3
q)/120 and
Fix(x)

(q + 1)/4 d = 2
(q + 1)/6 d > 2
Proof. To compute the bounds, we may assume that x M

has order d.
Suppose M = N(T

). If d > 2, then C
M
(x) = C
G
(x) and x
G
M = x
M
. This
implies that Fix(x) = 1. Assume that d = 2. If q is even, then x
G
M = x
M
and
Fix(x) = [C
G
(x) : C
M
(x)] = q/2 < (q 1)/2 + 1. If q is odd, assume without loss
that G = G
1
, so [M[ = 2(q 1). Then M has 3 classes of involutions, two of which
fuse in G. If x Z(M), then x
G
M = x y
M
where [C
G
(y) : C
M
(y)] = [M[/4.
It follows that Fix(x) = 1 + (q 1)/2. If x does not fuse to an element of Z(M),
then x
G
M = x
M
and Fix(x) = [C
G
(x) : C
M
(x)] = [M[/4 = (q 1)/2.
Suppose M = A
4
. Then either d = 2 or d = 3. Also, G = G
0
and q is odd, so
[G[ = (q
3
q)/2 and N = (q
3
q)/24. If d = 2, then Fix(x) = [C
G
(x)[/4 (q+1)/4.
If d = 3, then Fix(x) = 2 [C
G
(x)[/3 (q + 1)/3.
Suppose M = S
4
and G = G
1
. Then N = (q
3
q)/24. If d = 2, then Fix(x)
[C
G
(x)[/4 (q + 1)/2. If d = 3, then Fix(x) = [C
G
(x)[/3 (q + 1)/3. If d = 4,
then Fix(x) = [C
G
(x)[/4 (q + 1)/4.
Suppose M = S
4
and G = G
0
. Then N = (q
3
q)/48. If d = 2, then Fix(x) =
[C
G
(x)[/4 + [C
G
(x)[/8 (q + 1)/4 + (q + 1)/8 = 3(q + 1)/8. If d = 3, then
Fix(x) = [C
G
(x)[/3 (q + 1)/6. If d = 4, then Fix(x) = [C
G
(x)[/4 (q + 1)/8.
Suppose M = A
5
. Then d = 2, 3, or 5. Also, G = G
0
and q is odd, so [G[ =
(q
3
q)/2 and N = (q
3
q)/120. If d = 2, then Fix(x) = [C
G
(x)[/4 (q +1)/4. If
d = 3, then Fix(x) = [C
G
(x)[/3 (q + 1)/6. If d = 5, then Fix(x) = [C
G
(x)[/5
(q + 1)/10. 2
Lemma 3.17. Assume that G G
1
and that q 11. Set M
0
= M G
0
.
(1) If M = N(T
+
), then q 11, 13, 16, 17, 19.
(2) If M = N(T

), then q 11, 13, 16, 17, 19, 23.

(3) If M
0
= A
4
, then q 11, 13, 19.
(4) If M
0
= S
4
, then q 17, 23.
(5) If M = A
5
, then q 11, 19, 29, 31, 41.
Proof. We apply Lemma 2.10 to the bounds in the previous lemma.
If M = N(T

), then q(q+1)2 21(q1), whence q+2 21 and q 212.

If M
0
= A
4
, then
1
24
(q
3
q) 1 21(
1
2
(q + 1) 1) + 64(
1
3
(q + 1) 1). This
implies that q
3
765q 1252. The expression q
3
765q increases for q > 20 and
equals 972 when q = 27. Therefore q < 27. Since q 3 (mod 8), it follows that
q 19.
If M
0
= S
4
, then
1
48
(q
3
q) 1 21(
3
8
(q + 1) 1) + 64(
1
6
(q + 1) 1). This
implies that q
3
891q 3142. The expression q
3
891q increases for q > 30
and is positive for q = 30. Therefore q < 30. Since q 1 (mod 8), it follows
that q 25. However, L
2
(25) does not have a maximal subgroup isomorphic to S
4
.
Therefore q 17, 23.
If M
0
= A
5
, then
1
120
(q
3
q) 1 21(
1
4
(q + 1) 1) + 64(
1
6
(q + 1) 1). This
implies that q
3
1911q 8170. The expression q
3
1911q increases for q > 30
20 D. FROHARDT, R. GURALNICK, K. MAGAARD
and is positive for q = 45. Therefore q < 45. Since q 1 (mod 10), it follows
that q 11, 19, 29, 31, 41. 2
Lemma 3.18. If G , G
1
and M = N(T

), then q = 16 or 25.
Proof.
Step 1. Suppose h = 2. If M = N(T
+
), then
Fix(x)

q d = 2
1 d > 2
If M = N(T

), then
Fix(x)

(q + 3)/2 d = 2
q
1/2
+ 1 d > 2
Proof. By Lemma 3.16.1, we may assume that x M and x / G
1
.
If d = 2, then M = N(T
+
), and, without loss, G = G
2
. We have [C
G
(x)[ =
2q
1/2
(q 1) and x
G
M = x
M
1
x
M
2
where [C
M
(x
1
)[ = 4(q
1/2
1) and [C
M
(x
2
)[ =
4(q
1/2
+ 1). Therefore Fix(x) = [C
G
(x
1
) : C
M
(x
1
)] + [C
G
(x
1
) : C
M
(x
1
)] = q.
If d > 2, then x
G
M = x
M
. If d = 4 and M = N(T

), then [C
G
(x)[ 4(q
1/2
+
1) and [C
M
(x)[ = 4, so Fix(x) q
1/2
+ 1. In all remaining cases, C
G
(x) M, so
Fix(x) = 1. 2
Step 2. Suppose h > 2. If M = N(T
+
), then
Fix(x)

q d = 2
q
1/2
d = 4
q
1/3
(q
1/3
+ 1)/2 d ,= 2, 4
If M = N(T

), then
Fix(x)

(q + 3)/2 d = 2
q
1/2
+ 1 d = 2
a
, a 2
q
1/3
(q
1/3
1)/2 d ,= 2
a
Proof. By Lemma 3.16 and Step 1 it suces to assume that d ,= 2 and hence
that h(x) = h. If x has order h and h has an odd divisor e, then [C
G
(x
h/e
)[ =
h q
1/e
(q
2/e
1) and x
G
M = x
M
. Also, [C
M
(x)[ = 2e (q
1/e
1), so Fix(x) is as
claimed. If d = 2
a
= 2e, a 2 and M = N(T
+
), then x
2
xes M
g
if and only if x
2
xes the 1-spaces xed by (T
+
)
g
. The number of x
2
-invariant 1 spaces is q
1/e
+ 1
and the thus Fix(x) is as claimed, if e ,= 2. If d = 4 and M = N(T
+
), we have
[C
G
(x)[ = 4q
1/4
(q
1/2
1) and x
G
M = x
M
1
x
M
2
where [C
M
(x
1
)[ = 8(q
1/4
1)
and [C
M
(x
2
)[ = 8(q
1/4
+ 1). Therefore Fix(x) = [C
G
(x
1
) : C
M
(x
1
)] + [C
G
(x
1
) :
C
M
(x
1
)] = q
1/2
.
If d = 2
a
= 4ea 2 and M = N(T

), then Fix(x) Fix(x

e
) and the claim
follows from Step 1. 2
Step 3. If M = N(T
+
), then q 25.
Proof. Suppose h = 2. By Lemma 2.10, we have 15(q 1) q(q + 1)/2 1.
Therefore q
2
29q 31. It follows that q < 29. Since q is a perfect square, we
must have q 25.
GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1 21
Note that if q 27, then q
1/3
(q
1/3
+1)/21) q
1/2
so if h 3, then Lemma 2.10
and Step 2 imply that 9(q 1) + 28(q
1/3
(q
1/3
+ 1)/2 1) q(q + 1)/2 1. This
inequality fails for q 27, so we must also have q 25 in this case. 2
Step 4. If M = N(T

), then q 25.
Proof. If h = 2, then 15(q + 1)/2 + 34q
1/2
q(q 1)/2 1 by Lemma 2.10.
Therefore q
2
16q 68q
1/2
17, whence q < 49, so q 25. Now let m =
Max(q
1/2
+1, q
1/3
(q
1/3
1)/2). If h 3, then 9(q+1)/2+28(m1) q(q1)/21,
so q < 27. It follows that q 25. 2
2
Lemma 3.19. If M = N(T
+
) and q 11, then either
(1) q = 11, G = G
1
, and d = (2B, 4, 5) or
(2) q = 13, G = G
0
, and d = (2A, 3, 7).
Proof. This follows from inspection of the tables of indices for the groups of type
L
2
(q), q 25. Note that L
2
(16).2 cannot have a (2F, 3, 10F) generating system
because such a system would have genus 1 on points by the the Riemann-Hurwitz
formula. 2
The following four results now follow from inspection of the tables.
Lemma 3.20. If M = N(T

) and q 11, then one of the following is true

(1) q = 11, and either
(a) G = G
0
and d = (2A, 2A, 2A, 3) or
(b) G = G
1
, and d = (2B, 4, 5) or (2B, 4, 6).
(2) q = 13, G = G
0
, and d = (2A, 3, 7).
Lemma 3.21. If M
0

= A
4
and q 11, then one of the following is true.
(1) q = 11, G = G
1
, and d (2B, 4, 5), (2B, 4, 6), (2B, 3, 10), (2B, 3, 12)
(2) q = 13, G = G
0
, and d = (2A, 3, 7).
Lemma 3.22. If M
0

= S
4
and q 11, then q = 17, G = G
0
, and d = (2A, 3, 8).
Lemma 3.23. If M = A
5
and q 11, then one of the following is true.
(1) q = 11 and d (2A, 2A, 2A, 2A, 2A), (2A, 2A, 2A, 5), (2A, 2A, 2A, 6),
(2A, 2A, 3, 3), (2A, 3, 11), (2A, 5, 5), (2A, 5, 6), (2A, 6, 6), (3, 3, 5), (3, 3, 6).
(2) q = 19 and d = (2A, 3, 9) or (2A, 3, 10).
(3) q = 29 and d = (2A, 3, 7).
Lemma 3.24. (1) The group PSL(2, 11) does not have a generating system of
type (2A, 2A, 2A, 3).
(2) The group PGL(2, 11) has no generating systems of types (2B, 3, 12) or
(2B, 4, 6).
4. Unitary groups
Assume that F

(G)

= U
3
(q). Let P be the point stabilizer in the action on the
singular points of the natural module for G.
Lemma 4.1. If F

(G)

= U
3
(q), M is a maximal subgroup of G, and q
3
+1 [ [M[,
then one of the following is true.
22 D. FROHARDT, R. GURALNICK, K. MAGAARD
(1) q = 3 and M F

(G)

= L
3
(2).
(2) q = 5 and M F

(G)

= A
7
.
Lemma 4.2. If F

(G)

= U
3
(q) and G acts on the q
3
+1 totally singular points in
the natural module, then Fix(x) q + 1 for every x G

.
Lemma 4.3. If q > 5 and G is almost simple of type U
3
(q), then G does not have
a genus 0 action.
Proof. By Lemmas 3.2 and 4.1 it suces to show that G has no genus 0 actions on
the singular points in the natural module.
Suppose A is a genus 0 system of generators for the action of G on . We
have fpr(x) (q + 1)/(q
3
+ 1) = 1/(q
2
q + 1) for all x A. If q > 9, then
fpr(x) 1/(11
2
11 + 1) < 1/85. Therefore q 7, 8, 9. In all cases we have
fpr(x) 1/(7
2
7 + 1) = 1/43. Therefore A is of type (2, 3, 7) or (2, 3, 8). If
q = 8 or 9, then fpr(x) 1/(8
2
8 + 1) = 1/57, and A must be of type (2, 3, 7).
It therefore suces to show that there are no genus 0 systems of type (2, 3, 7) for
q = 7, 8, or 9, and no genus 0 system of type (2, 3, 8) for q = 7.
Since 7 ,[ [U
3
(9)[ we need only check this for q = 7 or 8.
If q = 7, then N = 344. Every element t of order 2 satises Fix(t) 8, so
Ind(t) 168. Every element u of order 3 satises Fix(u) = 2, so Ind(u) = 228.
Elements x of order 7 satisfy Fix(x) = 1, so Ind(x) = 294. Elements x of order
8 satisfy Fix(y) = 1 for all y x)

, so Ind(x) = 294. It follows that if A is

a generating system of type (2, 3, 7) or (2, 3, 8), then (A, G/P) 690, whence
g(G, P, A) 2.
If q = 8, then N = 513. Every element t of order 2 satises Fix(t) = 1, whence
Ind(t) = 256. Every element u of order 3 satises Fix(u) 9, whence Ind(u) 336.
Every element x of order 7 satises Fix(u) = 2, whence Ind(x) = 438. This shows
that if A is a generating system of type (2, 3, 7), then (A, G/P) 1030, whence
g(G, P, A) 3. 2
Lemma 4.4. Assume that G is almost simple of type U
3
(3), and that A is a genus
0 system for G
(1) If this is the P-action then either of U
3
(3) then A is of one of the following
types.
(a) When G is simple: (3B, 4AB, 4AB), or (4AB, 4AB, 4AB).
(b) When [G : F

(G)] = 2. (2B, 2B, 2B, 4D), (2B, 3B, 12CD), (2B, 4AB, 12CD),
(2B, 4D, 7AB), (2B, 4D, 12AB), (3A, 4D, 4D), (3B, 4D, 4D), or (4AB, 4D, 4D).
(2) In the action on nonsingular points A must be of one of the following types.
(a) When G is simple: (2A, 2A, 2A, 2A, 3B), (2A, 2A, 2A, 2A, 4C), (2A, 2A, 3A, 3B),
(2A, 2A, 3A, 4C), (2A, 2A, 3B, 4AB), (2A, 2A, 4AB, 4C), (2A, 6A, 7AB),
(2A, 6A, 8AB), (3B, 4AB, 4AB), or (4AB, 4AB, 4C).
(b) When [G : F

(G)] = 2: (2B, 3B, 12CD), (2B, 4C, 12CD), (2B, 4D, 7AB),
(3B, 4D, 4D), or (4C, 4D, 4D).
(3) In the X action of degree 63, A must be of one of the following types.
(a) When G is simple: (3B, 3A, 8AB).
(b) When [G : F

(G)] = 2: (2B, 3B, 12CD), or (2B, 4AB, 12CD).

(4) In the action of degree 63 on bases, A must be of one of the following types.
(a) When G is simple: (3B, 4A, 4AB).
(b) When [G : F

(G)] = 2: (2B, 3B, 12CD), (2B, 4D, 7AB), or (3B, 4D, 4D).
GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1 23
Lemma 4.5. (1) The group PSU(3, 3) does not have generating systems of
the following types.
(a) (2A, 2A, 2A, 2A, 3B)
(b) (2A, 2A, 2A, 2A, 4C)
(c) (2A, 2A, 3A, 3B)
(d) (2A, 2A, 3A, 4C)
(e) (2A, 2A, 3B, 4AB)
(f) (2A, 2A, 4AB, 4C)
(g) (3A, 3A, 8AB)
(h) (3B, 4AB, 4AB)
(i) (4AB, 4AB, 4AB)
(j) (4AB, 4AB, 4C)
(2) The group PU(3, 3) does not have generating systems of the following
types.
(a) (2B, 4AB, 12CD)
(b) (3A, 4D, 4D)
(c) (3B, 4D, 4D)
(d) (4AB, 4D, 4D)
(e) (4C, 4D, 4D)
Proof. GAP computation [7]. 2
Lemma 4.6. If A is a genus 0 system for the P-action of U
3
(4) then A is of one
of type (2B, 3A, 8AB). This system also has genus 0 in the action on nonsingular
points.
Proof. Let P be a maximal parabolic subgroup of G and let N be the stabilizer
of a non-singular point in the natural module. By inspection of Table 18, the
only r-tuples A with (A, G/P) = 2[G : P] 2 are of types (2A, 4A, 5AD),
(2A, 5AD, 5AD), or (2B, 3A, 8AB). Consideration of the action on N shows that
(A, G/N) < 2[G : N] 2 when A is of type (2A, 4A, 5AD) or (2A, 5AD, 5AD)
and that (A, G/N) = 2[G : N] 2 when A is of type (2B, 3A, 8AB). Therefore
A must be of type (2B, 3A, 8AB). We also have (A, G/B) = 2[G : N] + 2, so
g(A, G/B) = 2. 2
Lemma 4.7. Assume that G is almost simple of type U
3
(5) and that A is a genus
0 action of G on the cosets of M. Then M

= A
7
and either G

= U
3
(5) or G

=
U
3
(5).2.
(1) If G

= U
3
(5), then A is of type (2A, 2A, 2A, 6A), (2A, 4A, 10A), (2A, 5A, 6A),
(2A, 5CD, 6A), (2A, 5B, 7AB), (2A, 5B, 8AB), (3A, 4A, 4A), or (3A, 3A, 6A).
(2) G

= U
3
(5).2, then A is of type (2A, 2B, 2B, 4A), (2B, 6A, 6D), (2B, 4A, 8C),
(2B, 4A, 10B), (2B, 4A, 12B), (2B, 3A, 20AB), (3A, 4B, 6D), or (4B, 4B, 6A).
Proof. Let P be a maximal parabolic subgroup of G and let A be a subgroup
isomorphic to A
7
, the alternating group of degree 7. By inspection of Table 19,
the only r-tuples A with (A, G/P) = 2[G : P] 2 are of type (2B, 4B, 5ABCD).
Consideration of the action on cosets of A shows that (A, G/A) < 2[G : A] 2
when A is of one of these types.
Further inspection of the table shows that the listed types are the ones which
satisfy (A, G/A) = 2[G : A] 2. 2
24 D. FROHARDT, R. GURALNICK, K. MAGAARD
Lemma 4.8. (1) The group PSU(3, 5) does not have generating systems of
the following types.
(a) (2A, 2A, 2A, 6A)
(b) (2A, 5A, 6A)
(c) (2A, 5CD, 6A)
(d) (3A, 4A, 4A)
(e) (3A, 3A, 6A)
(2) The group PU(3, 5) does not have generating systems of the following
types.
(a) (3B, 4B, 6D)
(b) (4B, 4B, 6A)
Proof. GAP computation [7] 2
5. Exceptional groups
From [FM], the only genus 0 composition factors among the exceptional groups
of Lie rank 1 are the smallest Suzuki group
2
B
2
(8) and the smallest Ree group
2
G
2
(3)

= L
2
(8). The Ree group is considered in section 3.
Lemma 5.1. If G is an almost simple group of type
2
B
2
(q) and A is a genus 0
generating system for G acting on the cosets of M, then G

= Aut(
2
B
2
(2
3
)), M is
a parabolic subgroup of G and A is of type (3, 3, 4).
Proof. Consider rst the P-action. Suppose G = [G, G]. Then fpr(x) 2/65 for
all x G

. Since 3 ,[ [G[ the only possible systems are of type (2, 4, 5). However,
fpr(x) 1/65 for all elements x of order 2, 4, 5, so no such system exists because
c(2, 4, 5) = 41 < 65.
If G ,= [G, G], then h = 3 and fpr(x) 1/13 for all x G

. The only possible

systems are therefore of type (3, 3, d), d = 4, 5, 6. A short computation shows that
A is of type (3, 3, 4).
Because no maximal subgroup M of G is transitive on G/P, it follows that the
only genus 0 systems for arbitrary actions are of type (3, 3, 4). However, no element
of order 3 or 4 can have a xed point ratio larger than 1/25 in the other actions.
Therefore the only genus 0 action is on G/P. 2
6. Multiple components
In this section, assume that F

(G) is a product of groups of Lie rank 1 at least

one of which is not isomorphic to L
2
(5) or L
2
(9) and that F

(G) is not simple.

Assume that F

(G)

= L
1
. . . L
s
where s > 1. Let K =

i
N
G
(L
i
). We assume
that we have a primitive genus zero action of G (so a product action).
We give a sketch of the result in this case. In a sequel, we will address the general
problem of product actions.
The rst reduction is a minor generalization of [11]. The proof is essentially
identical.
Step 1. Either G/K is cyclic of order s 4, G/K

= S
3
and s = 3 or s = 4 and
G/K is a Klein group or dihedral group of order 8.
Let =
1
. . .
s
the G-set corresponding to the genus zero system.
Let J = N
G
(L
1
). This induces an action of J on
1
.
GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1 25
Then we have [10]:
Step 2. J has genus zero on
1
. Moreover, the system given for G determines the
corresponding system for J.
One can easily write down the system for J in terms of the system for G this
is essentially done in [11].
These two steps already reduce the problem to a quite small one by our results
for the almost simple case. We can then use GAP to determine all the possibilities.
The previous step applies even more generally for example, when s = 4, we see
there must be genus zero systems with just 2 components, leaving even fewer cases
to check.
7. Genus 0 groups in positive characteristic
Let : X Y be a nite separable cover of degree n of curves over an alge-
braically closed eld k of characteristic p 0. Let G be the monodromy group of
this cover (this is just the Galois group of the Galois closure of k(X)/k(Y )). Just
as for p = 0, we can ask what restrictions xing g(X) imposes on G. Just as for
p = 0, the critical case is when the cover is indecomposable. There is still a trans-
lation of the problem to group theory, but it is more complicated. We still have
a permutation action of G of degree n, but the Riemann-Hurwitz formula involves
higher ramication groups and is quite a bit more complicated. Moreover, there is
no analog of Riemanns Existence Theorem known. If all ramication is tame, then
the same analysis as in characteristic 0 suces to give a list of possibilities (some
of which need not occur). Indeed, until the 1999 MSRI semester on Galois groups,
there was not a single known example of a simple group which did not occur as a
composition factor of the monodromy group of a rational function (i.e. the case
where X = Y = P
1
).
There has been some very recent progress on this problem. It is now known
that if L is a xed type of nite group of Lie type, then there are only nitely
many q with p not dividing q such that L(q) is a composition factor of the mon-
odromy group of a cover X Y with X of xed genus g. If p[q, then in fact
Abhyankar has produced many examples when L is a classical group. There is also
a reduction theorem (much more dicult than the characteristic 0 case and giving
less information) which suggests that one should concentrate on the almost sim-
ple case. The results in [6] also apply in all characteristics which further suggests
that a very critical case to study is when G is a classical group and the permuta-
tion action is on some type of 1-space. We refer the reader to [10] for further details.
References
[1] M. Aschbacher On conjectures of Guralnick and Thompson. J. Algebra 135 (1990), no. 2,
277343.
[2] L. E. Dickson, Linear Groups, Dover Publication, New York, NY 1958
[3] D. Frohardt and K. Magaard, Monodromy composition factors among exceptional groups
of Lie type, in Group Theory, Proceedings of the Biennial Ohio State-Denison Conference,
134143 (eds. Sehgal and Solomon), World Scientic, Singapore, 1993.
[4] D. Frohardt and K. Magaard, Grassmannian xed point ratios, Geometriae Dedicata, 82
(2000) 21104.
26 D. FROHARDT, R. GURALNICK, K. MAGAARD
[5] D. Frohardt and K. Magaard, Composition Factors of Monodromy Groups, to appear in
Annals of Mathematics
[6] D. Frohardt, K. Magaard, and R. Guralnick, Incidence matrices, permutation characters
and the minimal genus of a permutation group, preprint.
[7] The GAP Group, GAP Groups, Algorithms, and Programming, Version 4.2 , Aachen,
St Andrews, 2000, (http://www-gap.dcs.st-and.ac.uk/~gap).
[8] D. Gorenstein, R. Lyons, and R. Solomon, The Classication of The Finite Simple Groups,
Contemporary Mathematics, vol. 40, American Mathematical Society, Providence, 1993.
[9] R. M. Guralnick, The genus of a permutation group in Groups, Combinatorics and Geome-
try, edited by M. Liebeck and J. Saxl, LMS Lecture Note Series 165, Cambridge University
Press, London, 1992.
[10] R. M. Guralnick, Monodromy groups of coverings of curves in Galois groups and funda-
mental groups, edited by L. Schneps
[11] R. M. Guralnick and M. G. Neubauer Monodromy groups of branched coverings: the
generic case. Recent developments in the inverse Galois problem (Seattle, WA, 1993),
325352, Contemp. Math., 186, Amer. Math. Soc., Providence, RI, 1995.
[12] R. M. Guralnick and J. G. Thompson, Finite groups of genus zero, J. Algebra 131 (1990),
303341.
[13] M. Liebeck and C. W. Purvis, On the genus of a nite classical group Bull. London Math.
Soc. 29 (1997), 159-164.
[14] M. Liebeck and J. Saxl, Minimal degrees of primitive permutation groups, with an appli-
cation to monodromy groups of covers of Riemann surfaces, Proc. London Math. Soc. (3)
63 (1991), 266314.
[15] M. Liebeck and A. Shalev, Simple groups, permutation groups, and probability,
J. Amer. Math. Soc. 12 (1999), 497520.
[16] K. Magaard, Monodromy and Sporadic Groups, Comm. Algebra 21 (1993), 42714297.
[17] W. Magnus, Non-Euclidean Tesselations and Their Groups, Academic Press, New York
London, 1974.
[18] M. G. Neubauer On primitive monodromy groups of genus zero and one. I. Comm. Algebra
21 (1993), 711746.
[19] M. G. Neubauer On monodromy groups of xed genus. J Algebra 153 (1992), 215261.
[20] T. Shih A note on groups of genus zero. Comm. Algebra 19 (1991), 28132826.
[21] L. Scott, Matrices and cohomology, Ann. Math. 105 (1977), 473492.
GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1 27
8. Appendix: Tables of indices
Table 5. Indices for primitive actions of L
2
(7)
P T
+
T

S
4
[PSL
2
]
8 14 28 54 21 40 7 12
2A 0 4 4 12 5 8 3 2
3 2 4 1 18 0 14 1 4
4 0 6 0 20 1 14 1 4
7 1 6 0 24 0 18 0 6
2B 2 3 4 12 3 9
6 2 5 1 22 0 17
8 0 7 0 24 1 17
Table 6. Indices for primitive actions of L
2
(8)
P T
+
T

9 16 36 70 28 54
2 1 4 4 16 4 12
3 0 6 0 24 1 18
7 2 6 1 30 0 24
9 0 8 0 32 1 24
3F 3 4 3 22 1 18
6F 1 6 1 28 1 22
9F 0 8 0 32 1 24
Table 7. Indices for primitive actions of L
2
(11)
P T
+
T

S
4
A
5
[PGL
2
] [PSL
2
]
12 22 66 130 55 108 55 108 11 20
2A 0 6 6 30 7 24 3 26 3 4
3 0 8 0 44 1 36 4 34 2 6
5 2 8 1 52 0 44 0 44 1 8
6 0 10 0 54 1 44 0 44 0 8
11 1 10 0 60 0 50 0 50 0 10
2B 2 5 6 30 5 25 5 25
4 0 9 0 48 1 39 3 39
10 2 9 1 58 0 49 0 49
12 0 11 0 60 1 49 0 49
28 D. FROHARDT, R. GURALNICK, K. MAGAARD
Table 8. Indices for primitive actions of L
2
(13)
P T
+
T

A
4
/S
4
14 26 91 180 78 154 91 180
2A 2 6 7 42 6 36 3 44
3 2 8 1 60 0 52 4 58
6 2 10 1 74 0 64 0 74
7 0 12 0 78 1 66 0 78
13 1 12 0 84 0 72 0 84
2B 0 7 7 42 8 35 7 42
4 2 9 1 66 0 57 3 66
12 2 11 1 82 0 71 0 82
14 0 13 0 84 1 71 0 84
Table 9. Indices for primitive actions of L
2
(16)
P T
+
T

PGL
2
(4)
17 32 136 270 120 238 68 134
2 1 8 8 64 8 56 4 32
3 2 10 1 90 0 80 5 42
5 2 12 1 108 0 96
15 2 14 1 126 0 112 0 62
17 0 16 0 128 1 112
2F
2
5 6 16 60 0 60 16 26
4F
2
1 12 0 100 4 86 0 50
6F
2
2 12 1 110 0 100 1 52
10F
2
0 14 1 120 0 108
4F
4
3 10 4 96 0 90 4 45
8F
4
1 14 0 118 2 102 0 59
12F
4
0 14 1 122 0 110 1 59
Table 10. Indices for primitive actions of L
2
(17)
P T
+
T

S
4
[PSL
2
]
18 34 153 304 136 270 102 202
2A 2 8 9 72 8 64 6 48
3 0 12 0 102 1 90 3 66
4 2 12 1 112 0 100 2 74
8 2 14 1 132 0 118 0 88
9 0 16 1 120
17 1 16 0 128
2B 0 9 10 63
6 0 15 1 111
16 2 15 0 127
18 0 17 1 127
GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1 29
Table 11. Indices for primitive actions of L
2
(19)
P T
+
T

A
5
S
4
[PSL
2
] [PGL
2
]
20 38 190 378 171 340 57 112 285 568
2A 0 10 10 90 11 80 5 26 5 140
3 2 12 1 126 0 114 3 36 6 186
5 0 16 1 136 2 44
9 2 16 1 168 0 152 0 50 0 252
10 0 18 1 152 0 50
19 1 18 0 162 0 54
2B 2 9 10 90 9 81 9 138
4 0 15 1 125
6 2 15 0 141
18 2 17 1 178 0 161 0 268
20 0 19 1 161
Table 12. Indices for primitive actions of L
2
(23)
P T
+
T

S
4
24 46 276 550 253 504 253 504
2A 0 12 12 132 13 120 9 122
3 0 16 0 184 1 168 4 166
4 0 18 0 204 1 186 3 186
6 0 20 0 228 1 208 0 208
11 2 20 1 250 0 230 0 230
12 0 22 0 252 1 230 0 230
23 1 22 0 264 0 242 0 242
2B 2 11 12 132 11 121
8 0 21 0 240 1 219
22 2 21 1 262 0 241
24 0 23 0 264 1 241
30 D. FROHARDT, R. GURALNICK, K. MAGAARD
Table 13. Indices for primitive actions of L
2
(25)
P T
+
T

PGL
2
(5)
26 50 325 648 300 598 65 128
2A 2 12 13 156 12 144 5 30
3 2 16 1 216 0 200 2 42
4 2 18 1 240 0 222 3 46
5 1 20 0 240
5

1 20 0 240
6 2 20 1 268 0 248 2 52
12 2 22 1 296 0 274 0 58
13 0 24 1 276
2B 0 13 13 156 14 143
8 2 21 1 282 0 261
24 2 23 1 310 0 287
26 0 25 0 312 1 287
2F 6 10 0 150
2F

6 10 0 150
4Fa 2 18 1 240 4 220 1 47
6F 0 20 1 266 0 250 2 51
6F

0 20 1 266 0 250 0 51
10F 1 22 0 270
10F

1 22 0 270
4Fb 0 19 1 240 6 219
8F 2 21 1 282 0 261
12F 0 23 1 296 0 274
Table 14. Indices for primitive actions of L
2
(27)
P T
+
T

L
28 54 378 754 351 700 819 1636
2A 0 14 14 182 15 168 7 406
3 1 18 0 234
7 0 24 1 300
13 2 24 0 324
14 0 26 1 324
2B 2 13 14 182 13 169 13 403
4 0 21 1 259
26 2 25 0 337
28 0 27 1 337
3F 4 16 6 248 3 232 9 540
6Fa 0 22 3 288
9F 1 24 0 312
6Fb 2 21 1 289
12F 0 25 0 344 1 319 1 747
GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1 31
Table 15. Indices for primitive actions of PL
2
(32)
P T
+
T

33 64 528 1054 496 990

2 1 16 16 256 16 240
3 0 22 1 330
11 0 30 1 450
31 2 30 0 480
33 0 32 1 480
5F 3 24 3 420 1 396
10F 1 28 1 444
15F 0 30 1 462
Table 16. Indices for parabolic actions of PL
2
(q), 49 q 169
q 49 64 81 121 169
N 50 65 82 122 170
98 128 162 242 338
x F(x) I(x) F(x) I(x) F(x) I(x) F(x) I(x) F(x) I(x)
2A 2 24 1 32 2 40 2 60 2 84
2B 0 25 0 41 0 61 0 85
3 2 32 2 42 1 54 2 80 2 112
4 2 36 2 60 2 90 2 126
5 0 40 0 52 2 64 2 96 0 136
6 2 40 2 100 2 140
7 1 42 2 54 2 144
8 2 42 2 70 2 105 2 147
9 2 56
10 0 45 2 72 2 108 0 153
11 1 110
12 2 44 2 110 2 154
2F 8 21 9 28 10 36 12 55 14 78
4Fa 0 37 1 48 2 60 0 91 2 126
4Fb 2 36 0 61 2 90 0 127
6F 2 39 0 52 1 66 0 99 2 138
8F 0 43 2 70 0 106 2 147
10F 0 72 2 107
12F 2 44 0 111 2 154
14F 1 45 2 58 0 156
16F 0 46 2 75
3F
3
5 40
6F
3
1 52
9F
3
2 56
15F
3
0 60
6F
6
3 50
12F
6
1 58
18F
6
0 60
32 D. FROHARDT, R. GURALNICK, K. MAGAARD
Table 17. Indices for primitive actions of U
3
(3)
P N X Y
28 54 36 70 63 124 63 124
2A 4 12 12 12 7 28 15 24
3A 1 18 0 24 9 36 0 42
3B 1 18 3 22 0 42 3 40
4AB 4 18 0 24 7 42 3 42
4C 0 20 4 22 3 44 3 42
6A 1 22 0 28 1 48 0 50
7AB 0 24 1 30 0 54 0 54
8AB 2 22 0 30 1 52 1 52
12AB 1 24 0 32 1 54 0 56
2B 4 12 4 16 9 27 7 28
4D 4 18 0 24 1 45 3 42
6B 1 22 1 28 0 51 1 50
8C 0 24 2 28 1 53 1 52
12CD 1 24 0 32 1 55 0 56
Table 18. Indices for primitive actions of U
3
(4)
P N B
65 128 208 414 416 830
2A 1 32 16 96 32 192
3A 2 42 1 138 5 274
4A 1 48 0 152 0 304
5AD 5 48 13 156 6 328
5EF 0 52
10AD 1 56
13 0 60
15 2 58
2B 5 30 16 96 16 200
6A 2 52
8AB 1 56 0 180 0 360
10AB 0 58
4B 3 46
12A 0 58
16AB 1 60
GENUS 0 ACTIONS OF GROUPS OF LIE RANK 1 33
Table 19. Indices for primitive actions of U
3
(5)
A
7
P
50 98 126 250
2A 10 20 6 60
3A 5 30 0 84
4A 2 34 2 92
5A 0 40 1 100
5B 5 36 1 100
5C 0 40 1 100
5D 0 40 1 100
6A 1 38 0 104
7AB 1 42 0 108
8AB 0 42 2 110
10A 0 44 1 112
3B 6 80
3C 0 84
6B 6 100
6C 0 102
12A 2 112
15A 1 116
21AB 0 120
24AB 2 118
30 1 120
2B 6 22 6 60
4B 10 30 6 90
6D 3 38 0 104
8C 0 42 2 108
10B 1 42 1 112
12B 1 42 0 114
20AB 0 46 1 118