关于几乎单群的2-Engel图的强连通性

Pub Date : 2023-09-19 DOI:10.1515/jgth-2023-0060

Francesca Dalla Volta, Fabio Mastrogiacomo, Pablo Spiga

{"title":"关于几乎单群的2-Engel图的强连通性","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":"{\"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}","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

摘要

有限群𝐺的恩格尔图是对𝐺中满足某个恩格尔词的元素对进行编码的有向图。Lucchini和第三位作者最近的工作表明，除了少数被充分理解的情况外，几乎简单群的恩格尔图是强连接的。在本文中，我们对这一分析进行了改进。

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

查看原文

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

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.

求助全文

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