Scholarlink

<p>The Engel graph of a finite group <i>G</i>, denoted Γ(<i>G</i>), is a directed graph encoding the pairs of elements in <i>G</i> satisfying some Engel word. Recent work of Detomi, Lucchini and Nemmi shows that Γ(<i>G</i>) is connected and the problem of understanding the strong connectivity of this graph has been reduced to the case where <i>G</i> is an almost simple group. In this paper, we complete the analysis by determining when Γ(<i>G</i>) is strongly connected in the almost simple setting; the only exceptions involve groups with socle PSL<sub>2</sub>(<i>q</i>) or <sup>2</sup><i>B</i><sub>2</sub>(<i>q</i>).</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

The Engel graph of almost simple groups

  • 期刊论文

  • 发表日期：

    2025年9月4日

查看全文
  • Andrea Lucchini,
  • Pablo Spiga

摘要

The Engel graph of a finite group G, denoted Γ(G), is a directed graph encoding the pairs of elements in G satisfying some Engel word. Recent work of Detomi, Lucchini and Nemmi shows that Γ(G) is connected and the problem of understanding the strong connectivity of this graph has been reduced to the case where G is an almost simple group. In this paper, we complete the analysis by determining when Γ(G) is strongly connected in the almost simple setting; the only exceptions involve groups with socle PSL2(q) or 2B2(q).