On the strong connectivity of the 2-Engel graphs of almost simple groups

Pub Date : 2023-09-19 DOI:10.1515/jgth-2023-0060
Francesca Dalla Volta, Fabio Mastrogiacomo, Pablo Spiga
{"title":"On the strong connectivity of the 2-Engel graphs of almost simple groups","authors":"Francesca Dalla Volta, Fabio Mastrogiacomo, Pablo Spiga","doi":"10.1515/jgth-2023-0060","DOIUrl":null,"url":null,"abstract":"Abstract The Engel graph of a finite group 𝐺 is a directed graph encoding the pairs of elements in 𝐺 satisfying some Engel word. Recent work of Lucchini and the third author shows that, except for a few well-understood cases, the Engel graphs of almost simple groups are strongly connected. In this paper, we give a refinement to this analysis.","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/jgth-2023-0060","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Abstract The Engel graph of a finite group 𝐺 is a directed graph encoding the pairs of elements in 𝐺 satisfying some Engel word. Recent work of Lucchini and the third author shows that, except for a few well-understood cases, the Engel graphs of almost simple groups are strongly connected. In this paper, we give a refinement to this analysis.
分享
查看原文
关于几乎单群的2-Engel图的强连通性
有限群𝐺的恩格尔图是对𝐺中满足某个恩格尔词的元素对进行编码的有向图。Lucchini和第三位作者最近的工作表明,除了少数被充分理解的情况外,几乎简单群的恩格尔图是强连接的。在本文中,我们对这一分析进行了改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
×
引用
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学术官方微信