Subgroups of prime power index in a simple group. (English) Zbl 0515.20011


20D05 Finite simple groups and their classification
20D06 Simple groups: alternating groups and groups of Lie type
20D08 Simple groups: sporadic groups
20D30 Series and lattices of subgroups
Full Text: DOI


[1] {\scM. Aschbacher}, Parabolics in groups of GF(2)-type, preprint.
[2] Carter, R, Simple groups of Lie type, (1972), Wiley New York · Zbl 0248.20015
[3] Conway, J, Three lectures on exceptional groups, ()
[4] Dickson, L, Linear groups with an exposition of the Galois field theory, (1962), Dover New York
[5] Finkelstein, L, The maximal subgroups of Conway’s group C3 and Mclaughlin’s group, J. algebra, 25, 58-89, (1973) · Zbl 0263.20010
[6] {\scD. Gorenstein and R. Lyons}, The local structure of finite groups of characteristic 2 type, preprint. · Zbl 0519.20014
[7] Liebler, R; Yellen, J, In search of nonsolvable groups of central type, Pacific J. math., 82, 485-492, (1979) · Zbl 0387.20006
[8] Mitchell, H, Determination of the ordinary and modular ternary linear groups, Trans. amer. math. soc., 12, 207-242, (1911) · JFM 42.0161.01
[9] Seitz, G, Flag-transitive subgroups of Chevalley groups, Ann. of math., 97, 27-56, (1973) · Zbl 0338.20052
[10] Suzuki, M, On a class of doubly transitive subgroups, Ann. of math., 75, 105-145, (1965)
[11] Walter, J, Finite groups with abelian Sylow 2-subgroups of order 8, Invent. math., 2, 332-376, (1967) · Zbl 0153.03603
[12] Ward, H, On Ree’s series of simple groups, Trans. amer. math. soc., 121, 62-89, (1966) · Zbl 0139.24902
[13] Wielandt, H, Finite permutation groups, (1964), Academic Press New York · Zbl 0138.02501
[14] Zsigmondy, K, Sur theorie de potenzrests, Monatsh. math. phys., 3, 265-284, (1892) · JFM 24.0176.02
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.