×

On groups associated with the affine subgroups of \(Sp_{2n}(2)\). (English) Zbl 07888185

Summary: The symplectic group \(Sp_{2n}(2)\) has an affine maximal subgroup of structure \(ASp_n = 2^{2n-1}: Sp_{2n-2}(2)\) which is a split extension of an elementary abelian 2-group \(N = 2^{2n-1}\) by \(G = Sp_{2n-2}(2)\). The vector space \(N = 2^{2n-1}\) and its dual \(N^\ast\) are not equivalent as \(2n-1\) dimensional \(G\)-modules over \(GF(2)\). Therefore, a split extension of the form \(\overline{G}_n = N^\ast:Sp_{2n-2}(2)\ncong N:Sp_{2n-2}(2)\) exists. In this paper, it will be shown that \(\overline{G}_n\cong \mathrm{Aut}(2^{2n-2}: Sp_{2n-2}(2)) = (2^{2n-2}:Sp_{2n-2}(2)):2\) for \(n \geq 3\). Moreover, the ordinary irreducible characters of \(\overline{G}_n\) are studied through the lens of Fischer-Clifford theory. As an example, the Fischer-Clifford matrix technique is used to construct the set \(\mathrm{Irr}(\overline{G}_5)\) of the group \(\overline{G}_5 = 2^9:Sp_8(2)\) which is associated with the affine subgroup \(ASp_5=2^9:Sp_8(2)\) of \(Sp_{10}(2)\).

MSC:

20C15 Ordinary representations and characters
20C40 Computational methods (representations of groups) (MSC2010)

Software:

Magma; GAP

References:

[1] Ali, F.: Fischer-Clifford Theory for Split and Non-Split Group Extensions, PhD Thesis, University of Natal (2001)
[2] Bosma, W., Canon, J.J.: Handbook of Magma Functions. University of Sydney, Department of Mathematics (November 1994)
[3] Chileshe, C.: Irreducible characters of Sylow p-Subgroups associated with some classical linear groups, PhD Thesis, North-West University (2016)
[4] Cline, E., Parshall, B., Brian, Scott, L.: Cohomology of finite groups of Lie type, I, Inst. Hautes Études Sci. Publ. Math. 45, 169-191 (1975) · Zbl 0412.20044
[5] Conway, JH; Curtis, RT; Norton, SP; Parker, RA; Wilson, RA, Atlas of Finite Groups, 1985, Oxford: Oxford University Press, Oxford · Zbl 0568.20001
[6] Fischer, B.: Clifford-matrices, Progr. Math. 95, Michler G.O. and Ringel C.(eds), Birkhauser, Basel, 1-16 (1991) · Zbl 0804.20003
[7] The GAP Group, GAP-Groups, Algorithms, and Programming, version 4.11.0; (2020). (http://www.gap-system.org)
[8] Isaacs, IM, Character Theory of Finite Groups, 1976, San Diego: Academic Press, San Diego · Zbl 0337.20005
[9] Karpilovsky, G.: Group Representations: Introduction to Group Representations and Characters, Vol 1 Part B, North - Holland Mathematics Studies 175, Amsterdam (1992) · Zbl 0757.20001
[10] Moori, J.: On the Groups \(G^+\) and \(\overline{G}\) of the forms \(2^{10} {:} M_{22}\) and \(2^{10}{ :} \overline{M}_{22} \), PhD thesis, University of Birmingham (1975)
[11] Mpono, Z.E.: Fischer-Clifford Theory and Character Tables of Group Extensions, PhD Thesis, University of Natal (1998)
[12] Musyoka, DM; Njuguna, LN; Prins, AL; Chikamai, L., On a maximal subgroup \(5^4{:}((3\times 2L_2 (25)){:}2_2)\) of the Monster \(\mathbb{M} \), Italian J. Pure Appl. Math., 49, 816-833, 2023
[13] Musyoka, DM; Njuguna, LN; Prins, AL; Chikamai, L., On a maximal subgroup of the orthogonal group \(O_8^+(3) \), Proyecciones, 41, 1, 161-185, 2022 · Zbl 1496.20013
[14] Prins, A.L.: Character tables of some groups of extension type, M.Sc Thesis, University of the Western Cape (2002)
[15] Seretlo, T.T.: Fischer Clifford Matrices and Character Tables of Certain Groups Associated with Simple Groups \(O^+_{10}(2), HS\) and \(Ly\), PhD Thesis, University of KwaZulu Natal (2011)
[16] Whitley, N.S.: Fischer matrices and character tables of group extensions, M.Sc Thesis, University of Natal (1994)
[17] Zimba, K.: Fischer-Clifford matrices of the generalized symmetric group and some associated groups, PhD Thesis, University of Natal (2005)
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.