# Regular orbits

N/A
N/A
Protected

Share "Regular orbits"

Copied!
82
0
0

Full text

(1)

### Orbits of linear groups

Martin Liebeck

Imperial College London

(2)

LetG ≤GLn(F) =GL(V), Fa field, G finite.

Will discuss results on orbits ofG onV:

1 Regular orbits

2 Number of orbits

3 Arithmetic conditions on orbit sizes, applications

Corresponding aﬃne permutation groupH :=VG ≤AGL(V), V = translation subgroup,G =H0 stabilizer of zero vector. Orbits ofG aresuborbits ofH, andHis primitive iﬀ G is irreducible onV.

(3)

LetG ≤GLn(F) =GL(V), Fa field, G finite.

Will discuss results on orbits ofG onV:

1 Regular orbits

2 Number of orbits

3 Arithmetic conditions on orbit sizes, applications

Corresponding aﬃne permutation groupH :=VG ≤AGL(V), V = translation subgroup,G =H0 stabilizer of zero vector. Orbits ofG aresuborbits ofH, andHis primitive iﬀ G is irreducible onV.

(4)

LetG ≤GLn(F) =GL(V), Fa field, G finite.

Will discuss results on orbits ofG onV:

1 Regular orbits

2 Number of orbits

3 Arithmetic conditions on orbit sizes, applications

Corresponding aﬃne permutation groupH :=VG ≤AGL(V), V = translation subgroup,G =H0 stabilizer of zero vector. Orbits ofG aresuborbits ofH, andHis primitive iﬀ G is irreducible onV.

(5)

LetG ≤GLn(F) =GL(V), Fa field, G finite.

Will discuss results on orbits ofG onV:

1 Regular orbits

2 Number of orbits

3 Arithmetic conditions on orbit sizes, applications

Corresponding aﬃne permutation groupH :=VG ≤AGL(V), V = translation subgroup,G =H0 stabilizer of zero vector. Orbits ofG aresuborbits ofH, andHis primitive iﬀ G is irreducible onV.

(6)

LetG ≤GLn(F) =GL(V), Fa field, G finite.

Will discuss results on orbits ofG onV:

1 Regular orbits

2 Number of orbits

3 Arithmetic conditions on orbit sizes, applications

Corresponding aﬃne permutation groupH:=VG ≤AGL(V), V = translation subgroup,G =H0 stabilizer of zero vector. Orbits ofG aresuborbits ofH, andHis primitive iﬀ G is irreducible onV.

(7)

### Regular orbits

LetG ≤GLn(F) =GL(V). ThenG has aregular orbit onV if∃ v∈V\0 such thatGv = 1. Regular orbit is vG ={vg :g ∈G}, size|G|.

IfH=VG ≤AGL(V) is corresponding aﬃne permutation group onV, this saysH0v = 1, i.e. H has abase of size 2.

Do regular orbits exist?

Sometimes no: eg. ifG =GLn(q) (where F=Fq finite). In general, no regular orbit if|G| ≥ |V|.

Sometimes yes: eg. G =�s�,s a Singer cycle inGLn(q) of order qn−1.

(8)

### Regular orbits

LetG ≤GLn(F) =GL(V). ThenG has a regular orbit onV if∃ v∈V\0 such thatGv = 1. Regular orbit is vG ={vg :g ∈G}, size|G|.

IfH=VG ≤AGL(V) is corresponding aﬃne permutation group onV, this saysH0v = 1, i.e. H has abase of size 2.

Do regular orbits exist?

Sometimes no: eg. ifG =GLn(q) (where F=Fq finite). In general, no regular orbit if|G| ≥ |V|.

Sometimes yes: eg. G =�s�,s a Singer cycle inGLn(q) of order qn−1.

(9)

### Regular orbits

LetG ≤GLn(F) =GL(V). ThenG has a regular orbit onV if∃ v∈V\0 such thatGv = 1. Regular orbit is vG ={vg :g ∈G}, size|G|.

IfH=VG ≤AGL(V) is corresponding aﬃne permutation group onV, this saysH0v = 1, i.e. H has abase of size 2.

Do regular orbits exist?

Sometimes no: eg. ifG =GLn(q) (where F=Fq finite). In general, no regular orbit if|G| ≥ |V|.

Sometimes yes: eg. G =�s�,s a Singer cycle inGLn(q) of order qn−1.

(10)

### Regular orbits

LetG ≤GLn(F) =GL(V). ThenG has a regular orbit onV if∃ v∈V\0 such thatGv = 1. Regular orbit is vG ={vg :g ∈G}, size|G|.

IfH=VG ≤AGL(V) is corresponding aﬃne permutation group onV, this saysH0v = 1, i.e. H has abase of size 2.

Do regular orbits exist?

Sometimes no: eg. ifG =GLn(q) (where F=Fq finite). In general, no regular orbit if|G| ≥ |V|.

Sometimes yes: eg. G =�s�,s a Singer cycle inGLn(q) of order qn−1.

(11)

### Regular orbits

LetG ≤GLn(F) =GL(V). ThenG has a regular orbit onV if∃ v∈V\0 such thatGv = 1. Regular orbit is vG ={vg :g ∈G}, size|G|.

IfH=VG ≤AGL(V) is corresponding aﬃne permutation group onV, this saysH0v = 1, i.e. H has abase of size 2.

Do regular orbits exist?

Sometimes no: eg. ifG =GLn(q) (where F=Fq finite).

In general, no regular orbit if|G| ≥ |V|.

Sometimes yes: eg. G =�s�,s a Singer cycle inGLn(q) of order qn−1.

(12)

### Regular orbits

LetG ≤GLn(F) =GL(V). ThenG has a regular orbit onV if∃ v∈V\0 such thatGv = 1. Regular orbit is vG ={vg :g ∈G}, size|G|.

IfH=VG ≤AGL(V) is corresponding aﬃne permutation group onV, this saysH0v = 1, i.e. H has abase of size 2.

Do regular orbits exist?

Sometimes no: eg. ifG =GLn(q) (where F=Fq finite). In general, no regular orbit if|G| ≥ |V|.

Sometimes yes: eg. G =�s�,s a Singer cycle inGLn(q) of order qn−1.

(13)

### Regular orbits

LetG ≤GLn(F) =GL(V). ThenG has a regular orbit onV if∃ v∈V\0 such thatGv = 1. Regular orbit is vG ={vg :g ∈G}, size|G|.

IfH=VG ≤AGL(V) is corresponding aﬃne permutation group onV, this saysH0v = 1, i.e. H has abase of size 2.

Do regular orbits exist?

Sometimes no: eg. ifG =GLn(q) (where F=Fq finite). In general, no regular orbit if|G| ≥ |V|.

Sometimes yes: eg. G =�s�,s a Singer cycle inGLn(q) of order qn−1.

(14)

### Regular orbits

WhenFis infinite:

Lemma Let G ≤GLn(F) =GL(V), G finite, Finfinite. Then G has a regular orbit on V .

Proof Suppose false. ThenGv �= 1 ∀v ∈V. So everyv ∈V lies inCV(g) :={v ∈V :vg =v} for someg ∈G\1, ie.

V = �

g∈G\1

CV(g).

But asFis infinite, V is not a union of finitely many proper subspaces. Contradiction.

ForF finite this argument shows ∃regular orbit ifF finite and

|F|>|G|.

(15)

### Regular orbits

WhenFis infinite:

Lemma Let G ≤GLn(F) =GL(V), G finite,F infinite. Then G has a regular orbit on V .

Proof Suppose false. ThenGv �= 1 ∀v ∈V. So everyv ∈V lies inCV(g) :={v ∈V :vg =v} for someg ∈G\1, ie.

V = �

g∈G\1

CV(g).

But asFis infinite, V is not a union of finitely many proper subspaces. Contradiction.

ForF finite this argument shows ∃regular orbit ifF finite and

|F|>|G|.

(16)

### Regular orbits

WhenFis infinite:

Lemma Let G ≤GLn(F) =GL(V), G finite,F infinite. Then G has a regular orbit on V .

Proof Suppose false. ThenGv �= 1 ∀v ∈V.

So every v ∈V lies inCV(g) :={v ∈V :vg =v} for someg ∈G\1, ie.

V = �

g∈G\1

CV(g).

But asFis infinite, V is not a union of finitely many proper subspaces. Contradiction.

ForF finite this argument shows ∃regular orbit ifF finite and

|F|>|G|.

(17)

### Regular orbits

WhenFis infinite:

Lemma Let G ≤GLn(F) =GL(V), G finite,F infinite. Then G has a regular orbit on V .

Proof Suppose false. ThenGv �= 1 ∀v ∈V. So everyv ∈V lies inCV(g) :={v ∈V :vg =v} for someg ∈G\1, ie.

V = �

g∈G\1

CV(g).

But asFis infinite, V is not a union of finitely many proper subspaces. Contradiction.

ForF finite this argument shows ∃regular orbit ifF finite and

|F|>|G|.

(18)

### Regular orbits

WhenFis infinite:

Lemma Let G ≤GLn(F) =GL(V), G finite,F infinite. Then G has a regular orbit on V .

Proof Suppose false. ThenGv �= 1 ∀v ∈V. So everyv ∈V lies inCV(g) :={v ∈V :vg =v} for someg ∈G\1, ie.

V = �

gG\1

CV(g).

But asFis infinite, V is not a union of finitely many proper subspaces. Contradiction.

ForF finite this argument shows ∃regular orbit ifF finite and

|F|>|G|.

(19)

### Regular orbits

WhenFis infinite:

Lemma Let G ≤GLn(F) =GL(V), G finite,F infinite. Then G has a regular orbit on V .

Proof Suppose false. ThenGv �= 1 ∀v ∈V. So everyv ∈V lies inCV(g) :={v ∈V :vg =v} for someg ∈G\1, ie.

V = �

gG\1

CV(g).

But asFis infinite, V is not a union of finitely many proper subspaces. Contradiction.

ForF finite this argument shows ∃regular orbit ifF finite and

|F|>|G|.

(20)

### Regular orbits

WhenFis infinite:

Lemma Let G ≤GLn(F) =GL(V), G finite,F infinite. Then G has a regular orbit on V .

Proof Suppose false. ThenGv �= 1 ∀v ∈V. So everyv ∈V lies inCV(g) :={v ∈V :vg =v} for someg ∈G\1, ie.

V = �

gG\1

CV(g).

But asFis infinite, V is not a union of finitely many proper subspaces. Contradiction.

ForF finite this argument shows∃ regular orbit ifF finite and

|F|>|G|.

(21)

### Regular orbits

WhenF=Fq finite,G ≤GLn(q) =GL(V):

Aim (i) If|G| ≥ |V|,G has no regular orbit onV

(ii) If|G|<|V|, proveG has a regular orbit, with the following exceptions....????

Far oﬀ. Delicate:

Example 1 Let G =Sc <GLc−1(p) =GL(V), where p >c and V ={(a1, . . . ,ac) :ai ∈Fp,�

ai = 0}. Then G has regular orbits onV. Number of regular orbits is

1

c!(p−1)(p−2)· · ·(p−c+ 1).

Example 2 Let G =Sc×C2 <GLc1(p) =GL(V), where p=c+ 1, V as above, C2 =�−1V�. ThenG has no regular orbits onV.

(22)

### Regular orbits

WhenF=Fq finite,G ≤GLn(q) =GL(V):

Aim (i) If|G| ≥ |V|,G has no regular orbit onV

(ii) If|G|<|V|, proveG has a regular orbit, with the following exceptions....????

Far oﬀ. Delicate:

Example 1 Let G =Sc <GLc−1(p) =GL(V), where p >c and V ={(a1, . . . ,ac) :ai ∈Fp,�

ai = 0}. Then G has regular orbits onV. Number of regular orbits is

1

c!(p−1)(p−2)· · ·(p−c+ 1).

Example 2 Let G =Sc×C2 <GLc1(p) =GL(V), where p=c+ 1, V as above, C2 =�−1V�. ThenG has no regular orbits onV.

(23)

### Regular orbits

WhenF=Fq finite,G ≤GLn(q) =GL(V):

Aim (i) If|G| ≥ |V|,G has no regular orbit onV

(ii) If|G|<|V|, proveG has a regular orbit, with the following exceptions....????

Far oﬀ. Delicate:

Example 1 Let G =Sc <GLc−1(p) =GL(V), where p >c and V ={(a1, . . . ,ac) :ai ∈Fp,�

ai = 0}. ThenG has regular orbits onV. Number of regular orbits is

1

c!(p−1)(p−2)· · ·(p−c+ 1).

Example 2 Let G =Sc×C2 <GLc1(p) =GL(V), where p=c+ 1, V as above, C2 =�−1V�. ThenG has no regular orbits onV.

(24)

### Regular orbits

WhenF=Fq finite,G ≤GLn(q) =GL(V):

Aim (i) If|G| ≥ |V|,G has no regular orbit onV

(ii) If|G|<|V|, proveG has a regular orbit, with the following exceptions....????

Far oﬀ. Delicate:

Example 1 Let G =Sc <GLc−1(p) =GL(V), where p >c and V ={(a1, . . . ,ac) :ai ∈Fp,�

ai = 0}. ThenG has regular orbits onV. Number of regular orbits is

1

c!(p−1)(p−2)· · ·(p−c+ 1).

Example 2 Let G =Sc×C2 <GLc1(p) =GL(V), where p=c+ 1, V as above, C2 =�−1V�. ThenG has no regular orbits onV.

(25)

### More on egular orbits

In general letG <GLn(q) with q varying, but fixed Brauer

character ofG. There is a poly f(x) of degree n such that number of regular orbits ofG is f(q). So ∃regular orbits for all but at mostn values ofq.

Eg. G =Sc <GLc−1(q), char(Fq)>n: here

f(q) = c!1(q−1)(q−2)· · ·(q−c+ 1). This is a poly in q with roots equal to the exponents of the Weyl groupW(Ac1)∼=Sc. Same holds for all finite reflection groups in their natural

representations (Orlik-Solomon). Eg. forG =W(F4)<GL4(q), number of regular orbits

1

|W(F4)|(q−1)(q−5)(q−7)(q−11).

Not always so nice, eg. forG =PSL2(7)<GL3(q) (of index 2 in a unitary reflection group),f(q) = 1681 (q−1)(q2+q−48).

(26)

### More on egular orbits

In general letG <GLn(q) with q varying, but fixed Brauer

character ofG. There is a poly f(x) of degree n such that number of regular orbits ofG is f(q).

So ∃regular orbits for all but at mostn values ofq.

Eg. G =Sc <GLc−1(q), char(Fq)>n: here

f(q) = c!1(q−1)(q−2)· · ·(q−c+ 1). This is a poly in q with roots equal to the exponents of the Weyl groupW(Ac1)∼=Sc. Same holds for all finite reflection groups in their natural

representations (Orlik-Solomon). Eg. forG =W(F4)<GL4(q), number of regular orbits

1

|W(F4)|(q−1)(q−5)(q−7)(q−11).

Not always so nice, eg. forG =PSL2(7)<GL3(q) (of index 2 in a unitary reflection group),f(q) = 1681 (q−1)(q2+q−48).

(27)

### More on egular orbits

In general letG <GLn(q) with q varying, but fixed Brauer

character ofG. There is a poly f(x) of degree n such that number of regular orbits ofG is f(q). So ∃regular orbits for all but at mostn values ofq.

Eg. G =Sc <GLc−1(q), char(Fq)>n: here

f(q) = c!1(q−1)(q−2)· · ·(q−c+ 1). This is a poly in q with roots equal to the exponents of the Weyl groupW(Ac1)∼=Sc. Same holds for all finite reflection groups in their natural

representations (Orlik-Solomon). Eg. forG =W(F4)<GL4(q), number of regular orbits

1

|W(F4)|(q−1)(q−5)(q−7)(q−11).

Not always so nice, eg. forG =PSL2(7)<GL3(q) (of index 2 in a unitary reflection group),f(q) = 1681 (q−1)(q2+q−48).

(28)

### More on egular orbits

In general letG <GLn(q) with q varying, but fixed Brauer

character ofG. There is a poly f(x) of degree n such that number of regular orbits ofG is f(q). So ∃regular orbits for all but at mostn values ofq.

Eg. G =Sc <GLc1(q), char(Fq)>n: here

f(q) = c!1(q−1)(q−2)· · ·(q−c+ 1). This is a poly in q with roots equal to the exponents of the Weyl groupW(Ac1)∼=Sc.

Same holds for all finite reflection groups in their natural

representations (Orlik-Solomon). Eg. forG =W(F4)<GL4(q), number of regular orbits

1

|W(F4)|(q−1)(q−5)(q−7)(q−11).

Not always so nice, eg. forG =PSL2(7)<GL3(q) (of index 2 in a unitary reflection group),f(q) = 1681 (q−1)(q2+q−48).

(29)

### More on egular orbits

In general letG <GLn(q) with q varying, but fixed Brauer

character ofG. There is a poly f(x) of degree n such that number of regular orbits ofG is f(q). So ∃regular orbits for all but at mostn values ofq.

Eg. G =Sc <GLc1(q), char(Fq)>n: here

f(q) = c!1(q−1)(q−2)· · ·(q−c+ 1). This is a poly in q with roots equal to the exponents of the Weyl groupW(Ac1)∼=Sc. Same holds for all finite reflection groups in their natural

representations (Orlik-Solomon). Eg. forG =W(F4)<GL4(q), number of regular orbits

1

|W(F4)|(q−1)(q−5)(q−7)(q−11).

Not always so nice, eg. forG =PSL2(7)<GL3(q) (of index 2 in a unitary reflection group),f(q) = 1681 (q−1)(q2+q−48).

(30)

### More on egular orbits

In general letG <GLn(q) with q varying, but fixed Brauer

character ofG. There is a poly f(x) of degree n such that number of regular orbits ofG is f(q). So ∃regular orbits for all but at mostn values ofq.

Eg. G =Sc <GLc1(q), char(Fq)>n: here

f(q) = c!1(q−1)(q−2)· · ·(q−c+ 1). This is a poly in q with roots equal to the exponents of the Weyl groupW(Ac1)∼=Sc. Same holds for all finite reflection groups in their natural

representations (Orlik-Solomon). Eg. forG =W(F4)<GL4(q), number of regular orbits

1

|W(F4)|(q−1)(q−5)(q−7)(q−11).

Not always so nice, eg. forG =PSL2(7)<GL3(q) (of index 2 in a unitary reflection group),f(q) = 1681 (q−1)(q2+q−48).

(31)

### Still more on regular orbits

General theory (Pahlings-Plesken): G <GLn(q) with q varying, fixed Brauer character. For each subgroupH <G there is a poly fH(q) of degree dimCV(H) such that number of orbits ofG with stabilizer conjugate toH isfH(q). ∃methods for computing these polys using “table of marks” ofG.

Eg. here’s the table of marks forA5: A5/C1 60

A5/C2 30 2 A5/C3 20 2 A5/V4 15 3 3

A5/C5 12 2

A5/S3 10 2 1 1

A5/D10 6 2 1 1

A5/A4 5 1 2 1 1

A5/A5 1 1 1 1 1 1 1 1 1

C1 C2 C3 V4 C5 S3 D10 A4 A5

(32)

### Still more on regular orbits

General theory (Pahlings-Plesken): G <GLn(q) with q varying, fixed Brauer character. For each subgroupH <G there is a poly fH(q) of degree dimCV(H) such that number of orbits ofG with stabilizer conjugate toH isfH(q). ∃ methods for computing these polys using “table of marks” ofG.

Eg. here’s the table of marks forA5: A5/C1 60

A5/C2 30 2 A5/C3 20 2 A5/V4 15 3 3

A5/C5 12 2

A5/S3 10 2 1 1

A5/D10 6 2 1 1

A5/A4 5 1 2 1 1

A5/A5 1 1 1 1 1 1 1 1 1

C1 C2 C3 V4 C5 S3 D10 A4 A5

(33)

### Still more on regular orbits

General theory (Pahlings-Plesken): G <GLn(q) with q varying, fixed Brauer character. For each subgroupH <G there is a poly fH(q) of degree dimCV(H) such that number of orbits ofG with stabilizer conjugate toH isfH(q). ∃ methods for computing these polys using “table of marks” ofG.

Eg. here’s the table of marks forA5: A5/C1 60

A5/C2 30 2 A5/C3 20 2 A5/V4 15 3 3

A5/C5 12 2

A5/S3 10 2 1 1

A5/D10 6 2 1 1

A5/A4 5 1 2 1 1

A5/A5 1 1 1 1 1 1 1 1 1

C1 C2 C3 V4 C5 S3 D10 A4 A5

(34)

### Yet more on regular orbits

Regular orbits ofG <GLn(q) crop up in several areas. A couple of examples:

1. Supposeallorbits regular, ie. Gv = 1∀v ∈V\0. Then aﬃne groupH=VG ≤AGL(V) is a Frobenius group(Hvw = 1∀v,w) andG aFrobenius complement. Classified by Zassenhaus. Eg. SL2(5)<GL2(q) (char >5)

OrSL2(5)⊗(Cr.Cs)<GL2(q)⊗GLr(q)<GL2r(q) (r|s−1, r,s >5)

(35)

### Yet more on regular orbits

Regular orbits ofG <GLn(q) crop up in several areas. A couple of examples:

1. Supposeallorbits regular, ie. Gv = 1∀v ∈V\0. Then aﬃne groupH=VG ≤AGL(V) is a Frobenius group(Hvw = 1∀v,w) andG aFrobenius complement. Classified by Zassenhaus. Eg. SL2(5)<GL2(q) (char >5)

OrSL2(5)⊗(Cr.Cs)<GL2(q)⊗GLr(q)<GL2r(q) (r|s−1, r,s >5)

(36)

### Yet more on regular orbits

Regular orbits ofG <GLn(q) crop up in several areas. A couple of examples:

1. Supposeallorbits regular, ie. Gv = 1∀v ∈V\0. Then aﬃne groupH=VG ≤AGL(V) is a Frobenius group(Hvw = 1∀v,w) andG aFrobenius complement. Classified by Zassenhaus.

Eg. SL2(5)<GL2(q) (char >5)

OrSL2(5)⊗(Cr.Cs)<GL2(q)⊗GLr(q)<GL2r(q) (r|s−1, r,s >5)

(37)

### Yet more on regular orbits

Regular orbits ofG <GLn(q) crop up in several areas. A couple of examples:

1. Supposeallorbits regular, ie. Gv = 1∀v ∈V\0. Then aﬃne groupH=VG ≤AGL(V) is a Frobenius group(Hvw = 1∀v,w) andG aFrobenius complement. Classified by Zassenhaus.

Eg. SL2(5)<GL2(q) (char >5)

OrSL2(5)⊗(Cr.Cs)<GL2(q)⊗GLr(q)<GL2r(q) (r|s−1, r,s >5)

(38)

### Yet more on regular orbits

Regular orbits ofG <GLn(q) crop up in several areas. A couple of examples:

1. Supposeallorbits regular, ie. Gv = 1∀v ∈V\0. Then aﬃne groupH=VG ≤AGL(V) is a Frobenius group(Hvw = 1∀v,w) andG aFrobenius complement. Classified by Zassenhaus.

Eg. SL2(5)<GL2(q) (char >5)

OrSL2(5)⊗(Cr.Cs)<GL2(q)⊗GLr(q)<GL2r(q) (r|s−1, r,s >5)

(39)

### Yet more on regular orbits

2. The k(GV)-problem This is

Conjecture Let G <GLn(p) =GL(V), G a p-group. The number of conjugacy classes k(VG) in the semidirect product VG satisfies

k(VG)≤ |V|.

Equivalent top-soluble case of Brauer’sk(B)-problem. Equality can hold, eg. G =�Singer−cycle� ∼=Cpn1

Robinson-Thompson reduction: conjecture proved if we can show that forG of “simple type” or ”extraspecial type”, there exists a regular orbit ofG on V.

“Simple type”: G has an irreducible normal subgroup H such that H/Z(H) is non-abelian simple.

(40)

### Yet more on regular orbits

2. The k(GV)-problem This is

Conjecture Let G <GLn(p) =GL(V), G a p-group. The number of conjugacy classes k(VG) in the semidirect product VG satisfies

k(VG)≤ |V|.

Equivalent top-soluble case of Brauer’sk(B)-problem. Equality can hold, eg. G =�Singer−cycle� ∼=Cpn1

Robinson-Thompson reduction: conjecture proved if we can show that forG of “simple type” or ”extraspecial type”, there exists a regular orbit ofG on V.

“Simple type”: G has an irreducible normal subgroup H such that H/Z(H) is non-abelian simple.

(41)

### Yet more on regular orbits

2. The k(GV)-problem This is

Conjecture Let G <GLn(p) =GL(V), G a p-group. The number of conjugacy classes k(VG) in the semidirect product VG satisfies

k(VG)≤ |V|.

Equivalent top-soluble case of Brauer’sk(B)-problem.

Equality can hold, eg. G =�Singer−cycle� ∼=Cpn1

Robinson-Thompson reduction: conjecture proved if we can show that forG of “simple type” or ”extraspecial type”, there exists a regular orbit ofG on V.

“Simple type”: G has an irreducible normal subgroup H such that H/Z(H) is non-abelian simple.

(42)

### Yet more on regular orbits

2. The k(GV)-problem This is

Conjecture Let G <GLn(p) =GL(V), G a p-group. The number of conjugacy classes k(VG) in the semidirect product VG satisfies

k(VG)≤ |V|.

Equivalent top-soluble case of Brauer’sk(B)-problem.

Equality can hold, eg. G =�Singer−cycle� ∼=Cpn1

Robinson-Thompson reduction: conjecture proved if we can show that forG of “simple type” or ”extraspecial type”, there exists a regular orbit ofG on V.

“Simple type”: G has an irreducible normal subgroup H such that H/Z(H) is non-abelian simple.

(43)

### Yet more on regular orbits

2. The k(GV)-problem This is

Conjecture Let G <GLn(p) =GL(V), G a p-group. The number of conjugacy classes k(VG) in the semidirect product VG satisfies

k(VG)≤ |V|.

Equivalent top-soluble case of Brauer’sk(B)-problem.

Equality can hold, eg. G =�Singer−cycle� ∼=Cpn1

Robinson-Thompson reduction: conjecture proved if we can show that forG of “simple type” or ”extraspecial type”, there exists a regular orbit ofG onV.

“Simple type”: G has an irreducible normal subgroup H such that H/Z(H) is non-abelian simple.

(44)

### Yet more on regular orbits

2. The k(GV)-problem This is

Conjecture Let G <GLn(p) =GL(V), G a p-group. The number of conjugacy classes k(VG) in the semidirect product VG satisfies

k(VG)≤ |V|.

Equivalent top-soluble case of Brauer’sk(B)-problem.

Equality can hold, eg. G =�Singer−cycle� ∼=Cpn1

Robinson-Thompson reduction: conjecture proved if we can show that forG of “simple type” or ”extraspecial type”, there exists a regular orbit ofG onV.

“Simple type”: G has an irreducible normal subgroup H such that H/Z(H) is non-abelian simple.

(45)

### Last one on regular orbits

Theorem (Hall-L-Seitz, Goodwin, Kohler-Pahlings, Riese) If G <GLn(p) is a p-group of simple type, then G has a regular orbit unless one of:

(i) Ac�G <GLc1(p), p >c

(ii) 23 exceptional cases, all with n≤10,p ≤61.

Eventuallyk(GV)-conjecture proved (Gluck, Magaard, Riese, Schmidt 2004)

General classification of linear groups with/without regular orbits is out of reach at the moment. Need substitutes...

(46)

### Last one on regular orbits

Theorem (Hall-L-Seitz, Goodwin, Kohler-Pahlings, Riese) If G <GLn(p) is a p-group of simple type, then G has a regular orbit unless one of:

(i) Ac�G <GLc1(p), p >c

(ii) 23 exceptional cases, all with n≤10,p ≤61.

Eventuallyk(GV)-conjecture proved (Gluck, Magaard, Riese, Schmidt 2004)

General classification of linear groups with/without regular orbits is out of reach at the moment. Need substitutes...

(47)

### Last one on regular orbits

Theorem (Hall-L-Seitz, Goodwin, Kohler-Pahlings, Riese) If G <GLn(p) is a p-group of simple type, then G has a regular orbit unless one of:

(i) Ac�G <GLc1(p), p >c

(ii) 23 exceptional cases, all with n≤10,p ≤61.

Eventuallyk(GV)-conjecture proved (Gluck, Magaard, Riese, Schmidt 2004)

General classification of linear groups with/without regular orbits is out of reach at the moment. Need substitutes...

(48)

### Last one on regular orbits

Theorem (Hall-L-Seitz, Goodwin, Kohler-Pahlings, Riese) If G <GLn(p) is a p-group of simple type, then G has a regular orbit unless one of:

(i) Ac�G <GLc1(p), p >c

(ii) 23 exceptional cases, all with n≤10,p ≤61.

Eventuallyk(GV)-conjecture proved (Gluck, Magaard, Riese, Schmidt 2004)

General classification of linear groups with/without regular orbits is out of reach at the moment. Need substitutes...

(49)

### Few orbits

LetG ≤GLn(q) =GL(V). There are results classifying groups G with few orbits onV\0.

One orbit G transitive on V\0. Equivalently, aﬃne group VG ≤AGL(V) is 2-transitive.

Hering’s theorem Classification of transitive linear groups G ≤GLn(q):

(i)G ≥SLn(q),Spn(q)

(ii)G ≥G2(q) (n= 6, q even) (iii)G ≤ΓL1(qn)

(iv)∼10 exceptions, all with |V| ≤592 (eg. F59◦SL2(5)<GL2(59)).

Two orbits ∃ similar classification (L) – hence the rank 3 aﬃne permutation groups.

Three, four,... orbits: can be done if desperate

(50)

### Few orbits

LetG ≤GLn(q) =GL(V). There are results classifying groups G with few orbits onV\0.

One orbit G transitive on V\0. Equivalently, aﬃne group VG ≤AGL(V) is 2-transitive.

Hering’s theorem Classification of transitive linear groups G ≤GLn(q):

(i)G ≥SLn(q),Spn(q)

(ii)G ≥G2(q) (n= 6, q even) (iii)G ≤ΓL1(qn)

(iv)∼10 exceptions, all with |V| ≤592 (eg. F59◦SL2(5)<GL2(59)).

Two orbits ∃ similar classification (L) – hence the rank 3 aﬃne permutation groups.

Three, four,... orbits: can be done if desperate

(51)

### Few orbits

LetG ≤GLn(q) =GL(V). There are results classifying groups G with few orbits onV\0.

One orbit G transitive on V\0. Equivalently, aﬃne group VG ≤AGL(V) is 2-transitive.

Hering’s theorem Classification of transitive linear groups G ≤GLn(q):

(i)G ≥SLn(q),Spn(q)

(ii)G ≥G2(q) (n= 6, q even) (iii)G ≤ΓL1(qn)

(iv)∼10 exceptions, all with |V| ≤592 (eg. F59◦SL2(5)<GL2(59)).

Two orbits ∃ similar classification (L) – hence the rank 3 aﬃne permutation groups.

Three, four,... orbits: can be done if desperate

(52)

### Few orbits

LetG ≤GLn(q) =GL(V). There are results classifying groups G with few orbits onV\0.

One orbit G transitive on V\0. Equivalently, aﬃne group VG ≤AGL(V) is 2-transitive.

Hering’s theorem Classification of transitive linear groups G ≤GLn(q):

(i)G ≥SLn(q),Spn(q)

(ii)G ≥G2(q) (n= 6, q even) (iii)G ≤ΓL1(qn)

(iv)∼10 exceptions, all with |V| ≤592 (eg.

F59◦SL2(5)<GL2(59)).

Two orbits ∃ similar classification (L) – hence the rank 3 aﬃne permutation groups.

Three, four,... orbits: can be done if desperate

(53)

### Few orbits

LetG ≤GLn(q) =GL(V). There are results classifying groups G with few orbits onV\0.

One orbit G transitive on V\0. Equivalently, aﬃne group VG ≤AGL(V) is 2-transitive.

Hering’s theorem Classification of transitive linear groups G ≤GLn(q):

(i)G ≥SLn(q),Spn(q)

(ii)G ≥G2(q) (n= 6, q even) (iii)G ≤ΓL1(qn)

(iv)∼10 exceptions, all with |V| ≤592 (eg.

F59◦SL2(5)<GL2(59)).

Two orbits ∃ similar classification (L) – hence the rank 3 aﬃne permutation groups.

Three, four,... orbits: can be done if desperate

(54)

### Few orbits

LetG ≤GLn(q) =GL(V). There are results classifying groups G with few orbits onV\0.

One orbit G transitive on V\0. Equivalently, aﬃne group VG ≤AGL(V) is 2-transitive.

Hering’s theorem Classification of transitive linear groups G ≤GLn(q):

(i)G ≥SLn(q),Spn(q)

(ii)G ≥G2(q) (n= 6, q even) (iii)G ≤ΓL1(qn)

(iv)∼10 exceptions, all with |V| ≤592 (eg.

F59◦SL2(5)<GL2(59)).

Two orbits ∃ similar classification (L) – hence the rank 3 aﬃne permutation groups.

Three, four,... orbits: can be done if desperate

(55)

### Arithmetic conditions on orbit sizes

Half-transitivity G ≤GLn(q) =GL(V) is 12-transitive if all orbits ofG onV\0 have equal size. (Aﬃne groupVG ≤AGL(V) is then

3

2-transitive.) Many examples, eg.

(a)G transitive

(b)G ≤ �s�,s Singer cycle of order qn−1

(c)G a Frobenius complement, eg. SL2(5)<GL2(q) (d)G =S(q)<GL2(q) (q odd), where

S(q) ={

� a 0 0 ±a1

� ,

� 0 a

±a1 0

:a∈Fq} Passman 1969The soluble 12-transitive linear groups are: Frobenius complements, subgroups of ΓL1(qn), S(q), and 6 exceptions withqn≤172.

General case....???

(56)

### Arithmetic conditions on orbit sizes

Half-transitivity G ≤GLn(q) =GL(V) is 12-transitive if all orbits ofG on V\0 have equal size. (Aﬃne groupVG ≤AGL(V) is then

3

2-transitive.)

Many examples, eg. (a)G transitive

(b)G ≤ �s�,s Singer cycle of order qn−1

(c)G a Frobenius complement, eg. SL2(5)<GL2(q) (d)G =S(q)<GL2(q) (q odd), where

S(q) ={

� a 0 0 ±a1

� ,

� 0 a

±a1 0

:a∈Fq} Passman 1969The soluble 12-transitive linear groups are: Frobenius complements, subgroups of ΓL1(qn), S(q), and 6 exceptions withqn≤172.

General case....???

(57)

### Arithmetic conditions on orbit sizes

Half-transitivity G ≤GLn(q) =GL(V) is 12-transitive if all orbits ofG on V\0 have equal size. (Aﬃne groupVG ≤AGL(V) is then

3

2-transitive.) Many examples, eg.

(a)G transitive

(b)G ≤ �s�,s Singer cycle of order qn−1

(c)G a Frobenius complement, eg. SL2(5)<GL2(q) (d)G =S(q)<GL2(q) (q odd), where

S(q) ={

� a 0 0 ±a1

� ,

� 0 a

±a1 0

:a∈Fq} Passman 1969The soluble 12-transitive linear groups are: Frobenius complements, subgroups of ΓL1(qn), S(q), and 6 exceptions withqn≤172.

General case....???

(58)

### Arithmetic conditions on orbit sizes

Half-transitivity G ≤GLn(q) =GL(V) is 12-transitive if all orbits ofG on V\0 have equal size. (Aﬃne groupVG ≤AGL(V) is then

3

2-transitive.) Many examples, eg.

(a) G transitive

(b)G ≤ �s�,s Singer cycle of order qn−1

(c)G a Frobenius complement, eg. SL2(5)<GL2(q) (d)G =S(q)<GL2(q) (q odd), where

S(q) ={

� a 0 0 ±a1

� ,

� 0 a

±a1 0

:a∈Fq} Passman 1969The soluble 12-transitive linear groups are: Frobenius complements, subgroups of ΓL1(qn), S(q), and 6 exceptions withqn≤172.

General case....???

(59)

### Arithmetic conditions on orbit sizes

Half-transitivity G ≤GLn(q) =GL(V) is 12-transitive if all orbits ofG on V\0 have equal size. (Aﬃne groupVG ≤AGL(V) is then

3

2-transitive.) Many examples, eg.

(a) G transitive

(b) G ≤ �s�,s Singer cycle of orderqn−1

(c)G a Frobenius complement, eg. SL2(5)<GL2(q) (d)G =S(q)<GL2(q) (q odd), where

S(q) ={

� a 0 0 ±a1

� ,

� 0 a

±a1 0

:a∈Fq} Passman 1969The soluble 12-transitive linear groups are: Frobenius complements, subgroups of ΓL1(qn), S(q), and 6 exceptions withqn≤172.

General case....???

(60)

### Arithmetic conditions on orbit sizes

Half-transitivity G ≤GLn(q) =GL(V) is 12-transitive if all orbits ofG on V\0 have equal size. (Aﬃne groupVG ≤AGL(V) is then

3

2-transitive.) Many examples, eg.

(a) G transitive

(b) G ≤ �s�,s Singer cycle of orderqn−1

(c) G a Frobenius complement, eg. SL2(5)<GL2(q)

(d)G =S(q)<GL2(q) (q odd), where S(q) ={

� a 0 0 ±a1

� ,

� 0 a

±a1 0

:a∈Fq} Passman 1969The soluble 12-transitive linear groups are: Frobenius complements, subgroups of ΓL1(qn), S(q), and 6 exceptions withqn≤172.

General case....???

(61)

### Arithmetic conditions on orbit sizes

Half-transitivity G ≤GLn(q) =GL(V) is 12-transitive if all orbits ofG on V\0 have equal size. (Aﬃne groupVG ≤AGL(V) is then

3

2-transitive.) Many examples, eg.

(a) G transitive

(b) G ≤ �s�,s Singer cycle of orderqn−1

(c) G a Frobenius complement, eg. SL2(5)<GL2(q) (d) G =S(q)<GL2(q) (q odd), where

S(q) ={

� a 0 0 ±a1

� ,

� 0 a

±a1 0

:a∈Fq}

Passman 1969The soluble 12-transitive linear groups are: Frobenius complements, subgroups of ΓL1(qn), S(q), and 6 exceptions withqn≤172.

General case....???

(62)

### Arithmetic conditions on orbit sizes

Half-transitivity G ≤GLn(q) =GL(V) is 12-transitive if all orbits ofG on V\0 have equal size. (Aﬃne groupVG ≤AGL(V) is then

3

2-transitive.) Many examples, eg.

(a) G transitive

(b) G ≤ �s�,s Singer cycle of orderqn−1

(c) G a Frobenius complement, eg. SL2(5)<GL2(q) (d) G =S(q)<GL2(q) (q odd), where

S(q) ={

� a 0 0 ±a1

� ,

� 0 a

±a1 0

:a∈Fq} Passman 1969The soluble 12-transitive linear groups are:

Frobenius complements, subgroups of ΓL1(qn),S(q), and 6 exceptions withqn≤172.

General case....???

(63)

### Arithmetic conditions on orbit sizes

Half-transitivity G ≤GLn(q) =GL(V) is 12-transitive if all orbits ofG on V\0 have equal size. (Aﬃne groupVG ≤AGL(V) is then

3

2-transitive.) Many examples, eg.

(a) G transitive

(b) G ≤ �s�,s Singer cycle of orderqn−1

(c) G a Frobenius complement, eg. SL2(5)<GL2(q) (d) G =S(q)<GL2(q) (q odd), where

S(q) ={

� a 0 0 ±a1

� ,

� 0 a

±a1 0

:a∈Fq} Passman 1969The soluble 12-transitive linear groups are:

Frobenius complements, subgroups of ΓL1(qn),S(q), and 6 exceptions withqn≤172.

General case....???

(64)

### Arithmetic conditions

p-exceptional groups Say G ≤GLn(p) =GL(V) is p-exceptional ifp divides G and all orbits ofG onV have size coprime to p. Ties in with previous notions:

(a)G p-exceptional ⇒ G hasno regular orbit onV (b)G transitive,p| |G| ⇒G p-exceptional

(c)G 12-transitive,p| |G| ⇒ G p-exceptional

∃many examples, eg. V =Wk,G =H wrK where H≤GL(W) is transitive onW\0 and K ≤Sk has all orbits on the power set of {1, . . . ,k}of p-size. (Eg. K ap-group)

Canp-exceptional linear groups be classified?

Yes, at least the irreducible ones ((Giudici, L, Praeger, Saxl, Tiep)...

(65)

### Arithmetic conditions

p-exceptional groups Say G ≤GLn(p) =GL(V) is p-exceptional ifp divides G and all orbits ofG onV have size coprime to p.

Ties in with previous notions:

(a)G p-exceptional ⇒ G hasno regular orbit onV (b)G transitive,p| |G| ⇒G p-exceptional

(c)G 12-transitive,p| |G| ⇒ G p-exceptional

∃many examples, eg. V =Wk,G =H wrK where H≤GL(W) is transitive onW\0 and K ≤Sk has all orbits on the power set of {1, . . . ,k}of p-size. (Eg. K ap-group)

Canp-exceptional linear groups be classified?

Yes, at least the irreducible ones ((Giudici, L, Praeger, Saxl, Tiep)...

(66)

### Arithmetic conditions

p-exceptional groups Say G ≤GLn(p) =GL(V) is p-exceptional ifp divides G and all orbits ofG onV have size coprime to p.

Ties in with previous notions:

(a)G p-exceptional ⇒ G hasno regular orbit onV (b)G transitive,p| |G| ⇒G p-exceptional

(c)G 12-transitive,p| |G| ⇒ G p-exceptional

∃many examples, eg. V =Wk,G =H wrK where H≤GL(W) is transitive onW\0 and K ≤Sk has all orbits on the power set of {1, . . . ,k}of p-size. (Eg. K ap-group)

Canp-exceptional linear groups be classified?

Yes, at least the irreducible ones ((Giudici, L, Praeger, Saxl, Tiep)...

(67)

### Arithmetic conditions

p-exceptional groups Say G ≤GLn(p) =GL(V) is p-exceptional ifp divides G and all orbits ofG onV have size coprime to p.

Ties in with previous notions:

(a)G p-exceptional ⇒ G hasno regular orbit onV

(b)G transitive,p| |G| ⇒G p-exceptional (c)G 12-transitive,p| |G| ⇒ G p-exceptional

∃many examples, eg. V =Wk,G =H wrK where H≤GL(W) is transitive onW\0 and K ≤Sk has all orbits on the power set of {1, . . . ,k}of p-size. (Eg. K ap-group)

Canp-exceptional linear groups be classified?

Yes, at least the irreducible ones ((Giudici, L, Praeger, Saxl, Tiep)...

(68)

### Arithmetic conditions

p-exceptional groups Say G ≤GLn(p) =GL(V) is p-exceptional ifp divides G and all orbits ofG onV have size coprime to p.

Ties in with previous notions:

(a)G p-exceptional ⇒ G hasno regular orbit onV (b)G transitive, p| |G| ⇒G p-exceptional

(c)G 12-transitive,p| |G| ⇒ G p-exceptional

∃many examples, eg. V =Wk,G =H wrK where H≤GL(W) is transitive onW\0 and K ≤Sk has all orbits on the power set of {1, . . . ,k}of p-size. (Eg. K ap-group)

Canp-exceptional linear groups be classified?

Yes, at least the irreducible ones ((Giudici, L, Praeger, Saxl, Tiep)...

(69)

### Arithmetic conditions

p-exceptional groups Say G ≤GLn(p) =GL(V) is p-exceptional ifp divides G and all orbits ofG onV have size coprime to p.

Ties in with previous notions:

(a)G p-exceptional ⇒ G hasno regular orbit onV (b)G transitive, p| |G| ⇒G p-exceptional

(c)G 12-transitive,p| |G| ⇒ G p-exceptional

∃many examples, eg. V =Wk,G =H wrK where H≤GL(W) is transitive onW\0 and K ≤Sk has all orbits on the power set of {1, . . . ,k}of p-size. (Eg. K ap-group)

Canp-exceptional linear groups be classified?

Yes, at least the irreducible ones ((Giudici, L, Praeger, Saxl, Tiep)...

(70)

### Arithmetic conditions

p-exceptional groups Say G ≤GLn(p) =GL(V) is p-exceptional ifp divides G and all orbits ofG onV have size coprime to p.

Ties in with previous notions:

(a)G p-exceptional ⇒ G hasno regular orbit onV (b)G transitive, p| |G| ⇒G p-exceptional

(c)G 12-transitive,p| |G| ⇒ G p-exceptional

∃many examples, eg. V =Wk,G =H wrK where H≤GL(W) is transitive onW\0 andK ≤Sk has all orbits on the power set of {1, . . . ,k}of p-size. (Eg. K ap-group)

Canp-exceptional linear groups be classified?

Yes, at least the irreducible ones ((Giudici, L, Praeger, Saxl, Tiep)...

(71)

### Arithmetic conditions

p-exceptional groups Say G ≤GLn(p) =GL(V) is p-exceptional ifp divides G and all orbits ofG onV have size coprime to p.

Ties in with previous notions:

(a)G p-exceptional ⇒ G hasno regular orbit onV (b)G transitive, p| |G| ⇒G p-exceptional

(c)G 12-transitive,p| |G| ⇒ G p-exceptional

∃many examples, eg. V =Wk,G =H wrK where H≤GL(W) is transitive onW\0 andK ≤Sk has all orbits on the power set of {1, . . . ,k}of p-size. (Eg. K ap-group)

Canp-exceptional linear groups be classified?

Yes, at least the irreducible ones ((Giudici, L, Praeger, Saxl, Tiep)...

(72)

### Arithmetic conditions

p-exceptional groups Say G ≤GLn(p) =GL(V) is p-exceptional ifp divides G and all orbits ofG onV have size coprime to p.

Ties in with previous notions:

(a)G p-exceptional ⇒ G hasno regular orbit onV (b)G transitive, p| |G| ⇒G p-exceptional

(c)G 12-transitive,p| |G| ⇒ G p-exceptional

∃many examples, eg. V =Wk,G =H wrK where H≤GL(W) is transitive onW\0 andK ≤Sk has all orbits on the power set of {1, . . . ,k}of p-size. (Eg. K ap-group)

Canp-exceptional linear groups be classified?

Yes, at least the irreducible ones ((Giudici, L, Praeger, Saxl, Tiep)...

(73)

### Arithmetic conditions

(G ≤GLn(p) =GL(V) isp-exceptionalifp dividesG and all orbits ofG onV have size coprime to p.)

Theorem Let G ≤GLd(p) =GL(V) be p-exceptional. Suppose G acts irreducibly and primitively on V . Then one of:

(i) G transitive on V\0 (ii) G ≤ΓL1(pn)

(iii) G =Ac,Sc <GLc(2), c = 2r −1 or 2r −2,�= 1 or 2 (iv) G =SL2(5)<GL4(3), orbits1,40,40

PSL2(11)<GL5(3), orbits1,22,110,110 M11<GL5(3), orbits1,22,220

M23<GL11(2), orbits 1,23,253,1771

Also have a classification of the imprimitivep-exceptional groups: V =Wk,G ≤HwrK whereH≤GL(W) is transitive onW\0 andK ≤Sk has all orbits on the power set of {1, . . . ,k}of p-size.

(74)

### Arithmetic conditions

(G ≤GLn(p) =GL(V) isp-exceptionalifp dividesG and all orbits ofG onV have size coprime to p.)

Theorem Let G ≤GLd(p) =GL(V) be p-exceptional. Suppose G acts irreducibly and primitively on V . Then one of:

(i) G transitive on V\0 (ii) G ≤ΓL1(pn)

(iii) G =Ac,Sc <GLc(2), c = 2r −1 or2r −2,�= 1 or 2 (iv) G =SL2(5)<GL4(3), orbits1,40,40

PSL2(11)<GL5(3), orbits1,22,110,110 M11<GL5(3), orbits1,22,220

M23<GL11(2), orbits 1,23,253,1771

Also have a classification of the imprimitivep-exceptional groups: V =Wk,G ≤HwrK whereH≤GL(W) is transitive onW\0 andK ≤Sk has all orbits on the power set of {1, . . . ,k}of p-size.

(75)

### Arithmetic conditions

(G ≤GLn(p) =GL(V) isp-exceptionalifp dividesG and all orbits ofG onV have size coprime to p.)

Theorem Let G ≤GLd(p) =GL(V) be p-exceptional. Suppose G acts irreducibly and primitively on V . Then one of:

(i) G transitive on V\0 (ii) G ≤ΓL1(pn)

(iii) G =Ac,Sc <GLc(2), c = 2r −1 or2r −2,�= 1 or 2 (iv) G =SL2(5)<GL4(3), orbits1,40,40

PSL2(11)<GL5(3), orbits1,22,110,110 M11<GL5(3), orbits1,22,220

M23<GL11(2), orbits 1,23,253,1771

Also have a classification of the imprimitivep-exceptional groups:

V =Wk,G ≤HwrK whereH≤GL(W) is transitive onW\0 andK ≤Sk has all orbits on the power set of {1, . . . ,k}of p-size.

(76)

### Consequences

RecallG 12-transitive ⇒all orbits on V\0 have same size⇒ G is p-exceptional. Hence

Theorem If G ≤GLd(p) is 12-transitive and p divides |G|, then one of:

(i) G is transitive on V\0 (ii) G ≤ΓL1(pd)

(iii) G =SL2(5)<GL4(3), orbits1,40,40.

(77)

### Consequences

RecallG 12-transitive ⇒all orbits on V\0 have same size⇒ G is p-exceptional. Hence

Theorem If G ≤GLd(p) is 12-transitive and p divides |G|, then one of:

(i) G is transitive on V\0 (ii) G ≤ΓL1(pd)

(iii) G =SL2(5)<GL4(3), orbits1,40,40.

(78)

### Consequences

RecallG 12-transitive ⇒all orbits on V\0 have same size⇒ G is p-exceptional. Hence

Theorem If G ≤GLd(p) is 12-transitive and p divides |G|, then one of:

(i) G is transitive on V\0 (ii) G ≤ΓL1(pd)

(iii) G =SL2(5)<GL4(3), orbits1,40,40.

(79)

### Consequences

Gluck-Wolf theorem 1984 Let p be a prime and G a finite p-soluble group. Suppose N�G and N has an irreducible character φsuch thatχ(1)/φ(1) is coprime to p for allχ⊆φG. Then G/N has abelian Sylow p-subgroups.

This implies Brauer’sheight zeroconjecture forp-soluble groups. Using our classification ofp-exceptional groups, Tiep and Navarro have proved the Gluck-Wolf theorem for arbitrary finite groupsG. May lead to the complete solution of the height zero conjecture.

(80)

### Consequences

Gluck-Wolf theorem 1984 Let p be a prime and G a finite p-soluble group. Suppose N�G and N has an irreducible character φsuch thatχ(1)/φ(1) is coprime to p for allχ⊆φG. Then G/N has abelian Sylow p-subgroups.

This implies Brauer’sheight zeroconjecture forp-soluble groups. Using our classification ofp-exceptional groups, Tiep and Navarro have proved the Gluck-Wolf theorem for arbitrary finite groupsG. May lead to the complete solution of the height zero conjecture.

(81)

### Consequences

Gluck-Wolf theorem 1984 Let p be a prime and G a finite p-soluble group. Suppose N�G and N has an irreducible character φsuch thatχ(1)/φ(1) is coprime to p for allχ⊆φG. Then G/N has abelian Sylow p-subgroups.

This implies Brauer’sheight zeroconjecture forp-soluble groups.

Using our classification ofp-exceptional groups, Tiep and Navarro have proved the Gluck-Wolf theorem for arbitrary finite groupsG. May lead to the complete solution of the height zero conjecture.

(82)

### Consequences

Gluck-Wolf theorem 1984 Let p be a prime and G a finite p-soluble group. Suppose N�G and N has an irreducible character φsuch thatχ(1)/φ(1) is coprime to p for allχ⊆φG. Then G/N has abelian Sylow p-subgroups.

This implies Brauer’sheight zeroconjecture forp-soluble groups.

Using our classification ofp-exceptional groups, Tiep and Navarro have proved the Gluck-Wolf theorem for arbitrary finite groupsG. May lead to the complete solution of the height zero conjecture.

References

Related documents

155 H2a: The size of a terrorist group is limited by homophily and the political, economic, and social environment in which the group

disadvantage have special resonance for the Australian Aboriginal community, where the construct, the best interests of the child, has been applied and has resulted in an

The Swedish school authorities have drawn attention to this work and designated the school ‘the best school in Sweden working for equal value 2008’. Student empowerment, child’s

One may restrict attention to the groups that have a strictly finite presentation: a profinite (or pro-p) group G has this property if it has a finite presentation as a profinite

finite p-groups, character degrees, conjugacy class sizes, Kirillov orbit meth- ods, Lazard correspondence, relatively free p-groups.... In Theorem A we show that the class

The total ABC contribution to Australian screen drama, combined with approximately \$125 million in external funding, delivered up to \$244 million in production value to

This observation motivates the topic of the current paper, where we study regular maps whose automorphism groups have the property that all their Sylow subgroups contain a

Students further their understanding of rhythm, pitch, dynamics and expression, form and structure, timbre and texture in music; extend their understanding and use of aural

In this section, we determine bounds for the dimensions of faithful irreducible repre- sentations of almost quasisimple groups that admit no regular orbits.. Moreover, Lemma 3.1

We also obtain necessary conditions involving the rank of A and the exponent of its automorphism group, which allow us to construct large classes of abelian groups that fail to have

Sessional Com m ittee on the Environm ent 79.. A strong research and development effort, particularly into the integration of control methods, is essential to the

We expect that it is possible to reduce the classification to a finite calculation, and that the p-groups of a given coclass can be partitioned into finitely many families, where

• Additional High Conservation Value Vegetation (AHCVV) means areas of vegetation which were found during ground-truthing which would otherwise meet the definition of Existing

Theorem 1.18 If we have a sequence of groups and homomorphisms linking them which contains the following part which is exact at G:.. 1 → G → θ H then θ is

We show that it is unique up to isomorphism among those having a point a whose stabilizer in the automorphism group both fixes setwise every line on a and contains a subgroup that

Intermediate growth is inherited by subgroups of finite index, so the same applies to the groups N(T ) ≤ Γ and the associated maps.... Example Nilpotent-by-finite groups have

For all but E 8 (q) in even characteristic, our algorithms to construct the SL 2 subgroups and to label the root and toral elements are black-box provided that the algorithms

More generally, G with large abelian factor group may have Cayley graphs with diameter proportional to |G|... The diameter

Gow  proved that the conjecture holds for the symplectic groups P Sp 2n (q) if q ≡ 1 mod 4, and in  proved that every semisimple element of a finite simple group of Lie type

5.15 At the time of Mr C’s requests for access to the NDIS, the NDIA did not have any policy or guideline dealing specifically with incarcerated individuals and access to the NDIS.

Classification of reflexible regular Cayley maps on abelian groups. Classification of t-balanced regular Cayley map on

Rich theory of cartesian decompositions preserved by groups with a transitive minimal normal subgroup.

existence. In making such an estimate, the Government Printer was requested to take as understood that each author body would have its report printed by the