arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2311.04486math.GRmath.CO
收藏

关于 Engel 图的直径

On the diameter of Engel graphs

Andrea Lucchini, Pablo Spiga

AI总结:

本文研究有限群 Engel 有向图在强连通情形下的直径,并给出一个不依赖具体群的绝对上界。

摘要:

给定有限群 $G$,$G$ 的 Engel 图是一个有向图 $\Gamma(G)$,用于编码满足某个 Engel 字的元素对。换言之,$\Gamma(G)$ 是这样的有向图:其顶点为 $G$ 的非超中心元素,并且存在一条从 $x$ 到 $y$ 的弧,当且仅当对某个 $n \in \mathbb{N}$ 有 $[x,_n y]=1$。根据以往工作可知,除少数例外情况外,$\Gamma(G)$ 都是强连通的。本文在 $\Gamma(G)$ 强连通时,给出了其直径的一个绝对上界。

英文摘要:

Given a finite group $G$, the Engel graph of $G$ is a directed graph $Γ(G)$ encoding pairs of elements satisfying some Engel word. Namely, $Γ(G)$ is the directed graph, where the vertices are the non-hypercentral elements of $G$ and where there is an arc from $x$ to $y$ if and only if $[x,_ n y] = 1$ for some $n \in \mathbb{N}$. From previous work, it is known that, except for a few exceptions, $Γ(G)$ is strongly connected. In this paper, we give an absolute upper bound on the diameter of $Γ(G)$, when $Γ(G)$ is strongly connected.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑