arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2406.00261math.GRcs.DM
收藏

具有测地Cayley图的有限群

Finite groups with geodetic Cayley graphs

Murray Elder, Adam Piggott, Florian Stober, Alexander Thumm, Armin Weiß

AI总结:

本文研究了有限群测地Cayley图的猜想,提出系列理论结果辅助计算机搜索,验证了大小不超过1024的群及若干无限群族的猜想,核心贡献是利用群中心阶数和生成集界限大幅缩减搜索空间。

摘要:

连通无向图被称为测地图(geodetic),如果对于每一对顶点,都存在连接它们的唯一最短路径。此前有猜想认为,对于有限群,仅有的测地Cayley图是奇圈和完全图。在本文中,我们提出了一系列理论结果,这些结果有助于进行计算机搜索,从而验证该猜想对于所有大小不超过1024的群均成立。该猜想也在包括二面体群和一些幂零群族在内的若干无限群族中得到了验证。使计算机搜索能够达到如此深度的两个关键结果是:如果群的中心具有偶数阶,则该猜想成立(这从我们的计算机搜索中排除了所有的 $2$-群);如果Cayley图是测地图,则存在关联群的大小、生成集与中心的界限(这显著减少了必须搜索的生成集数量)。

英文摘要:

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and complete graphs. In this article we present a series of theoretical results which contribute to a computer search verifying this conjecture for all groups of size up to 1024. The conjecture is also verified for several infinite families of groups including dihedral and some families of nilpotent groups. Two key results which enable the computer search to reach as far as it does are: if the center of a group has even order, then the conjecture holds (this eliminates all $2$-groups from our computer search); if a Cayley graph is geodetic then there are bounds relating the size of the group, generating set and center (which significantly cuts down the number of generating sets which must be searched).

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

↑