实现有限群的自动化

Pub Date : 2024-02-08 DOI:10.1515/jgth-2022-0145

Sylvia Bayard, Justin Lynd

{"title":"实现有限群的自动化","authors":"Sylvia Bayard, Justin Lynd","doi":"10.1515/jgth-2022-0145","DOIUrl":null,"url":null,"abstract":"It is shown that any finite group 𝐴 is realizable as the automizer in a finite perfect group 𝐺 of an abelian subgroup whose conjugates generate 𝐺. The construction uses techniques from fusion systems on arbitrary finite groups, most notably certain realization results for fusion systems of the type studied originally by Park.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-02-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Realizing finite groups as automizers\",\"authors\":\"Sylvia Bayard, Justin Lynd\",\"doi\":\"10.1515/jgth-2022-0145\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is shown that any finite group 𝐴 is realizable as the automizer in a finite perfect group 𝐺 of an abelian subgroup whose conjugates generate 𝐺. The construction uses techniques from fusion systems on arbitrary finite groups, most notably certain realization results for fusion systems of the type studied originally by Park.\",\"PeriodicalId\":0,\"journal\":{\"name\":\"\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0,\"publicationDate\":\"2024-02-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1515/jgth-2022-0145\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1515/jgth-2022-0145","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

研究表明，任何有限群𝐴都可以实现为一个有限完全群𝐺的自动子群，其共轭子群生成𝐺。这个构造使用了任意有限群上融合系统的技术，其中最著名的是 Park 最初研究的那类融合系统的某些实现结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

Realizing finite groups as automizers

It is shown that any finite group 𝐴 is realizable as the automizer in a finite perfect group 𝐺 of an abelian subgroup whose conjugates generate 𝐺. The construction uses techniques from fusion systems on arbitrary finite groups, most notably certain realization results for fusion systems of the type studied originally by Park.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助