Fischer群Fi_{23}的表示论存在性证明
Representation theoretic existence proof for Fischer group Fi_{23}
摘要:
在这篇高级论文的第一部分中,作者提供了一些新的有效的有限置换群计算算法。它们在计算机代数系统MAGMA中找不到,但可以在那里实现。对于任何具有给定生成元集合的有限群G,算法将G的固定子群的生成元计算为关于原始生成元的短字。另一种新的算法为G的给定元素提供了这样的短字。在后面的章节中,作者利用G.由GL_n(2)的不可约子群构造有限单群的Michler算法[11].这一零星群最初是由B. Fischer在[6]中通过研究3-换位群,也见[5]。本文给出了其群的表示理论和算法存在性证明。利用F=GF(2)上Mathieu群M_{23}的两个11维非同构单模构造了三个非同构扩张E_i.在两种情况下,Michler算法失败了。在第三种情况下,作者构造了任意目标单群G中E_i的2-中心对合z的中心化子H=C_G(z).这允许作者在GL_{782}(17)中构造G。计算了它的四个生成矩阵、特征标表和共轭类的表示式。因此G和Fi_{23}具有相同的字符表。
英文摘要:
In the first section of this senior thesis the author provides some new efficient algorithms for calculating with finite permutation groups. They cannot be found in the computer algebra system MAGMA, but they can be implemented there. For any finite group G with a given set of generators, the algorithms calculate generators of a fixed subgroup of G as short words in terms of original generators. Another new algorithm provides such a short word for a given element of G. In the later sections, the author gives a self-contained existence proof for Fischer's sporadic simple group Fi_{23} using G. Michler's Algorithm [11] constructing finite simple groups from irreducible subgroups of GL_n(2). This sporadic group was originally discovered by B. Fischer in [6] by investigating 3-transposition groups, see also [5]. This thesis gives a representation theoretic and algorithmic existence proof for his group. The author constructs the three non-isomorphic extenstions E_i by the two 11-dimensional non-isomorphic simple modules of the Mathieu group M_{23} over F=GF(2). In two cases Michler's Algorithm fails. In the third case the author constructs the centralizer H=C_G(z) of a 2-central involution z of E_i in any target simple group G. This allows the author to construct G inside GL_{782}(17). Its four generating matrices, character table and representatives for conjugacy classes are computed. It follows that G and Fi_{23} have the same character table.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。