zbMATH — the first resource for mathematics

On the minimal degrees of projective representations of the finite Chevalley groups. (English) Zbl 0325.20008

20C25 Projective representations and multipliers
20D05 Finite simple groups and their classification
20G40 Linear algebraic groups over finite fields
Full Text: DOI
[1] Bourbaki, N, Groupes et algèbres de Lie, (1968), Hermann Paris · Zbl 0186.33001
[2] Brauer, R, On the connection between the ordinary and modular characters of groups of finite order, Ann. of math., 42, 926-935, (1941) · Zbl 0061.03701
[3] Curtis, C.W; Iwahori, N; Kilmoyer, R, Hecke algebras and characters of parabolic type of finite groups with BN-pairs, Math. pub. I.H.E.S., 40, 81-116, (1972) · Zbl 0254.20004
[4] {\scC. W. Curtis, W. Kantor, and G. Seitz}, The 2-transitive permutation representatives of the finite Chevalley groups (to appear). · Zbl 0374.20002
[5] Feit, W, ()
[6] {\scB. Fischer}, Finite groups generated by 3-transpositions (to appear). · Zbl 0232.20040
[7] Fong, P; Seitz, G; Fong, P; Seitz, G, Groups with a (B, N)-pair of rank 2, I, II, Invent. math., Invent. math., 24, 191-239, (1974) · Zbl 0295.20049
[8] {\scR. Griess}, Shur multipliers of the finite simple groups of Lie type (to appear). · Zbl 0297.20023
[9] Hering, C, On linear groups which contain an ineducible subgroup of prime order, (), 59-105
[10] Landazuri, V, Cot para caracteres de los grupos de Chevalley, Rev. colombiana mat., 6, 125-165, (1972)
[11] Patton, W, The minimum index for subgroups in some classical group, ()
[12] Suzuki, M, On a class of doubly transitive groups, Ann. of math., 75, 105-145, (1962) · Zbl 0106.24702
[13] Ward, H.N, On Ree’s series of simple groups, Trans. amer. math. soc., 121, 8-62, (1966) · Zbl 0139.24902
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.