在Baby Monster找到47:23

Q1 Mathematics
J. Bray, R. Parker, R. Wilson
{"title":"在Baby Monster找到47:23","authors":"J. Bray, R. Parker, R. Wilson","doi":"10.1112/S1461157016000024","DOIUrl":null,"url":null,"abstract":"In this paper we describe methods for finding very small maximal subgroups of very large groups, with particular application to the subgroup 47:23 of the Baby Monster. This example is completely intractable by standard or naive methods. The example of finding 31:15 inside the Thompson group $\\text{Th}$\n is also discussed as a test case.","PeriodicalId":54381,"journal":{"name":"Lms Journal of Computation and Mathematics","volume":"19 1","pages":"229-234"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1112/S1461157016000024","citationCount":"1","resultStr":"{\"title\":\"Finding 47:23 in the Baby Monster\",\"authors\":\"J. Bray, R. Parker, R. Wilson\",\"doi\":\"10.1112/S1461157016000024\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we describe methods for finding very small maximal subgroups of very large groups, with particular application to the subgroup 47:23 of the Baby Monster. This example is completely intractable by standard or naive methods. The example of finding 31:15 inside the Thompson group $\\\\text{Th}$\\n is also discussed as a test case.\",\"PeriodicalId\":54381,\"journal\":{\"name\":\"Lms Journal of Computation and Mathematics\",\"volume\":\"19 1\",\"pages\":\"229-234\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1112/S1461157016000024\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Lms Journal of Computation and Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1112/S1461157016000024\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Lms Journal of Computation and Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1112/S1461157016000024","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}
引用次数: 1

摘要

本文描述了寻找非常大群的非常小的极大子群的方法,并特别应用于小怪物的47:23子群。这个例子是完全难以处理的标准或幼稚的方法。在Thompson组$\text{Th}$中查找31:15的示例也作为测试用例进行了讨论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Finding 47:23 in the Baby Monster
In this paper we describe methods for finding very small maximal subgroups of very large groups, with particular application to the subgroup 47:23 of the Baby Monster. This example is completely intractable by standard or naive methods. The example of finding 31:15 inside the Thompson group $\text{Th}$ is also discussed as a test case.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Lms Journal of Computation and Mathematics
Lms Journal of Computation and Mathematics MATHEMATICS, APPLIED-MATHEMATICS
CiteScore
2.60
自引率
0.00%
发文量
0
审稿时长
>12 weeks
期刊介绍: LMS Journal of Computation and Mathematics has ceased publication. Its final volume is Volume 20 (2017). LMS Journal of Computation and Mathematics is an electronic-only resource that comprises papers on the computational aspects of mathematics, mathematical aspects of computation, and papers in mathematics which benefit from having been published electronically. The journal is refereed to the same high standard as the established LMS journals, and carries a commitment from the LMS to keep it archived into the indefinite future. Access is free until further notice.
×
引用
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学术官方微信