有限群的对称表示

J. A. Roche
{"title":"有限群的对称表示","authors":"J. A. Roche","doi":"10.52783/jas.v9i1.1444","DOIUrl":null,"url":null,"abstract":"It is often the case that a progenitor, P = m* n : N, factored by a subgroup generated by one or more relators, M = {iriwi, , 7TfcWfc), gives a finite group F, particularly, a classical group, simple group, or a sporadic group. In such instances, the presentation of the factor group, G = P/M = {x, y, t), is also a symmetric presentation of the finite group F. Symmetric presentations of groups allow us to represent, and ma­ nipulate, group elements in a manner that is typically more convenient than conventional techniques; in this sense, symmetric presentations are particularly useful in the study of large finite groups. In this thesis, we first construct, by manual double coset enumeration, the groups A5, S5, Sq, S7, and S7 x 3 as finite homomorphic images of the progenitors 2* 3 : S3, 2* 4 : A4, 2* 5 : A5, 3* 5 : S5, and 3* 5 : S5, respectively. We also demonstrate that their respective symmetric presentations enable us to represent, and manipulate, their group elements in a convenient (symmetric) fashion as well as to obtain, in most cases, useful permutation representations for their group elements. We devote the majority of our efforts to the construction, and manipulation, of M12: 2, or Aut(Mi2), the outer automorphism group of the Mathieu group M12. In particular, we construct, by the technique of manual double coset enumeration over S4, the group Aut(Mi2) as a finite homomorphic image of the progenitor 3* 4 : S4. By way of this construction, we show that Aut(Afi2) is isomorphic to 3* 4 : S4 factored by two relations and we conclude that the symmetric presentation (x, y,t | x4 = y2 = (yx)3 = t3 = [t,y] = [i33,?/] = (yxt)10 = ((x2y)2t)5 = e) defines the group Aut(Mi2). Finally, we demonstrate that this symmetric presentation enables us to express and manipulate every element of Aut(Mi2) either as a symmetric representation of the form 7rw, where tt is a permutation of S4 on 4 letters and w is a word of concatenated generators of length at most eight, or as a permutation representation on 7920 letters.","PeriodicalId":41066,"journal":{"name":"Journal of Algebraic Statistics","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Symmetric Presentations of Finite Groups\",\"authors\":\"J. A. Roche\",\"doi\":\"10.52783/jas.v9i1.1444\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is often the case that a progenitor, P = m* n : N, factored by a subgroup generated by one or more relators, M = {iriwi, , 7TfcWfc), gives a finite group F, particularly, a classical group, simple group, or a sporadic group. In such instances, the presentation of the factor group, G = P/M = {x, y, t), is also a symmetric presentation of the finite group F. Symmetric presentations of groups allow us to represent, and ma­ nipulate, group elements in a manner that is typically more convenient than conventional techniques; in this sense, symmetric presentations are particularly useful in the study of large finite groups. In this thesis, we first construct, by manual double coset enumeration, the groups A5, S5, Sq, S7, and S7 x 3 as finite homomorphic images of the progenitors 2* 3 : S3, 2* 4 : A4, 2* 5 : A5, 3* 5 : S5, and 3* 5 : S5, respectively. We also demonstrate that their respective symmetric presentations enable us to represent, and manipulate, their group elements in a convenient (symmetric) fashion as well as to obtain, in most cases, useful permutation representations for their group elements. We devote the majority of our efforts to the construction, and manipulation, of M12: 2, or Aut(Mi2), the outer automorphism group of the Mathieu group M12. In particular, we construct, by the technique of manual double coset enumeration over S4, the group Aut(Mi2) as a finite homomorphic image of the progenitor 3* 4 : S4. By way of this construction, we show that Aut(Afi2) is isomorphic to 3* 4 : S4 factored by two relations and we conclude that the symmetric presentation (x, y,t | x4 = y2 = (yx)3 = t3 = [t,y] = [i33,?/] = (yxt)10 = ((x2y)2t)5 = e) defines the group Aut(Mi2). Finally, we demonstrate that this symmetric presentation enables us to express and manipulate every element of Aut(Mi2) either as a symmetric representation of the form 7rw, where tt is a permutation of S4 on 4 letters and w is a word of concatenated generators of length at most eight, or as a permutation representation on 7920 letters.\",\"PeriodicalId\":41066,\"journal\":{\"name\":\"Journal of Algebraic Statistics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Algebraic Statistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.52783/jas.v9i1.1444\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Algebraic Statistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52783/jas.v9i1.1444","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

通常的情况是,一个祖先P = m* n: n被一个或多个关联子群m = {iriwi,, 7TfcWfc)分解后,得到一个有限群F,特别是经典群、简单群或偶发群。在这种情况下,因子群G = P/M = {x, y, t)的表示也是有限群f的对称表示。群的对称表示允许我们以一种通常比传统技术更方便的方式表示和操纵群元素;在这个意义上,对称表示在研究大型有限群时特别有用。在本文中,我们首先通过人工双余集枚举,分别构造了群A5、S5、Sq、S7和S7 × 3为前导群2* 3:S3、2* 4:A4、2* 5:A5、3* 5:S5和3* 5:S5的有限同态象。我们还证明了它们各自的对称表示使我们能够以一种方便的(对称)方式表示和操作它们的群元素,并且在大多数情况下获得它们的群元素的有用的置换表示。我们将大部分精力投入到M12: 2的构造和操作上,即Mathieu群M12的外自同构群Aut(Mi2)。特别地,我们利用在S4上的人工双余集枚举技术,构造了群Aut(Mi2)作为祖元3* 4:S4的有限同态象。通过这种构造,我们证明了Aut(Afi2)同构于3* 4:S4的两个关系因式,并得出对称表示(x, y,t | x4 = y2 = (yx)3 = t3 = [t,y] = [i33,?/] = (yxt)10 = ((x2y)2t)5 = e)定义了群Aut(Mi2)。最后,我们证明了这种对称表示使我们能够将Aut(Mi2)的每个元素表示和操作为7rw形式的对称表示,其中tt是S4在4个字母上的排列,w是长度最多为8个的连接生成器的单词,或者作为7920个字母的排列表示。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Symmetric Presentations of Finite Groups
It is often the case that a progenitor, P = m* n : N, factored by a subgroup generated by one or more relators, M = {iriwi, , 7TfcWfc), gives a finite group F, particularly, a classical group, simple group, or a sporadic group. In such instances, the presentation of the factor group, G = P/M = {x, y, t), is also a symmetric presentation of the finite group F. Symmetric presentations of groups allow us to represent, and ma­ nipulate, group elements in a manner that is typically more convenient than conventional techniques; in this sense, symmetric presentations are particularly useful in the study of large finite groups. In this thesis, we first construct, by manual double coset enumeration, the groups A5, S5, Sq, S7, and S7 x 3 as finite homomorphic images of the progenitors 2* 3 : S3, 2* 4 : A4, 2* 5 : A5, 3* 5 : S5, and 3* 5 : S5, respectively. We also demonstrate that their respective symmetric presentations enable us to represent, and manipulate, their group elements in a convenient (symmetric) fashion as well as to obtain, in most cases, useful permutation representations for their group elements. We devote the majority of our efforts to the construction, and manipulation, of M12: 2, or Aut(Mi2), the outer automorphism group of the Mathieu group M12. In particular, we construct, by the technique of manual double coset enumeration over S4, the group Aut(Mi2) as a finite homomorphic image of the progenitor 3* 4 : S4. By way of this construction, we show that Aut(Afi2) is isomorphic to 3* 4 : S4 factored by two relations and we conclude that the symmetric presentation (x, y,t | x4 = y2 = (yx)3 = t3 = [t,y] = [i33,?/] = (yxt)10 = ((x2y)2t)5 = e) defines the group Aut(Mi2). Finally, we demonstrate that this symmetric presentation enables us to express and manipulate every element of Aut(Mi2) either as a symmetric representation of the form 7rw, where tt is a permutation of S4 on 4 letters and w is a word of concatenated generators of length at most eight, or as a permutation representation on 7920 letters.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Journal of Algebraic Statistics
Journal of Algebraic Statistics STATISTICS & PROBABILITY-
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信