×

Maximal solvable subgroups of odd index in symmetric groups. (English. Russian original) Zbl 1484.20033

Algebra Logic 59, No. 2, 114-128 (2020); translation from Algebra Logika 59, No. 2, 169-189 (2020).
Summary: Maximal solvable subgroup subgroup of odd index. Maximal solvable subgroups of odd index in symmetric groups are classified up to conjugation.

MSC:

20D25 Special subgroups (Frattini, Fitting, etc.)
20D10 Finite solvable groups, theory of formations, Schunck classes, Fitting classes, \(\pi\)-length, ranks
20E28 Maximal subgroups
20B05 General theory for finite permutation groups
Full Text: DOI

References:

[1] Galois, E., Mémoire sur les conditions de résolubilité des équations par radicaux, J. Math. Pures Appl. (Liouville), 11, 417-433 (1846)
[2] Jordan, M., Commentaire sur le Mémoire de Galois, Comptes Rendus, 60, 770-774 (1865)
[3] Jordan, C., Traité des Substitutions et des Équations Algébriques (1870), Paris: Gauthier-Villars, Paris · Zbl 0828.01011
[4] Suprunenko, DA, Matrix Groups [in Russian] (1972), Moscow: Nauka, Moscow
[5] Mann, A., Soluble subgroups of symmetric and linear groups, Isr. J. Math., 55, 2, 162-172 (1986) · Zbl 0609.20015 · doi:10.1007/BF02801992
[6] Kantor, WM, Primitive permutation groups of odd degree, and an application to finite projective planes, J. Alg., 106, 1, 15-45 (1987) · Zbl 0606.20003 · doi:10.1016/0021-8693(87)90019-6
[7] M. W. Liebeck and J. Saxl, “The primitive permutation groups of odd degree,” J. London Math. Soc., II. Ser., 31, No. 2, 250-264 (1985). · Zbl 0573.20004
[8] Maslova, NV, Classification of maximal subgroups of odd index in finite simple classical groups: Addendum, Sib. El. Mat. Izv., 15, 707-718 (2018) · Zbl 1395.20014
[9] N. V. Maslova, “Classification of maximal subgroups of odd index in finite simple classical groups,” Trudy Inst. Mat. Mekh. UrO RAN, 14, No. 4, 100-118 (2008). · Zbl 1238.20029
[10] Maslova, NV, Classification of maximal subgroups of odd index in finite groups with alternating socle, Trudy Inst. Mat. Mekh. UrO RAN, 16, 3, 182-184 (2010) · Zbl 1304.20033
[11] Maslova, NV, Maximal subgroups of odd index in finite groups with simple orthogonal socle, Trudy Inst. Mat. Mekh. UrO RAN, 16, 4, 237-245 (2010)
[12] Maslova, NV, Maximal subgroups of odd index in finite groups with simple linear, unitary, or symplectic socle, Algebra and Logic, 50, 2, 133-145 (2011) · Zbl 1260.20029 · doi:10.1007/s10469-011-9128-7
[13] Guo, W.; Revin, DO, Maximal and submaximal X-subgroups, Algebra and Logic, 57, 1, 9-28 (2018) · Zbl 1428.20025 · doi:10.1007/s10469-018-9475-8
[14] Guo, W.; Revin, DO, Pronormality and submaximal X-subgroups on finite groups, Comm. Math. Stat., 6, 3, 289-317 (2018) · Zbl 1502.20014 · doi:10.1007/s40304-018-0154-9
[15] H. Wielandt, “Zusammengesetzte Gruppen: Holders Programm heute,” in Finite Groups, Proc. Symp. Pure Math., 37, Am. Math. Soc., Providence, RI (1980), pp. 161-173. · Zbl 0458.20024
[16] Aschbacher, M., On finite groups of Lie type and odd characteristic, J. Alg., 66, 2, 400-424 (1980) · Zbl 0445.20008 · doi:10.1016/0021-8693(80)90095-2
[17] J. D. Dixon and B. Mortimer, Permutation Groups, Grad. Texts Math., 163, Springer, New York (1996). · Zbl 0951.20001
[18] Wielandt, H., Finite Permutation Groups (1964), New York: Academic Press, New York · Zbl 0138.02501
[19] Thompson, JG, Hall subgroups of the symmetric groups, J. Comb. Theory, 1, 2, 271-279 (1966) · Zbl 0144.26101 · doi:10.1016/S0021-9800(66)80032-7
[20] Kargapolov, MI; Merzlyakov, YI, Fundamentals of Group Theory [in Russian] (1982), Moscow: Nauka, Moscow · Zbl 0508.20001
[21] B. Huppert, Endliche Gruppen. I, Grundl. Math. Wissensch. Einzeldarst., 134, Springer, Berlin (1967). · Zbl 0217.07201
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.