arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2511.00541math.GR
收藏

恰好有一个非交换子群的群

A Group with Exactly One Noncommutator

The American University in Cairo(开罗美国大学)

Omar Hatem, Daoud Siniora

AI总结:

本文通过算法方法发现两个阶数为368640的非同构群,其中仅有一个元素是非交换子群,解决了群论中的开放问题。

摘要:

在群论中,是否存在一个阶数至少为三的有限群,其中除了一个元素外所有元素都是交换子群的问题一直未得到解决。本文通过开发一种算法方法来解决这一开放性问题,该方法利用了此类群的若干群论性质。具体来说,我们利用了弗罗贝尼乌斯的结果以及此类群的各种必要性质,结合普莱森和霍尔对有限完美群的广泛枚举,系统地检查了所有有限群直至某个阶数以寻找所需性质。本文的工作核心是使用计算机系统GAP(Groups, Algorithms, and Programming)实现的。我们发现了两个非同构的阶数为368640的群,它们表现出所需的性质。我们的研究还证明,这样的群的最小阶数就是这个阶数。因此,本研究为Kourovka笔记中的问题17.76提供了肯定答案。除了算法框架外,本文还提供了所发现的一个群的结构描述。

英文摘要:

The question of whether there exists a finite group of order at least three in which every element except one is a commutator has remained unresolved in group theory. In this article, we address this open problem by developing an algorithmic approach that leverages several group theoretic properties of such groups. Specifically, we utilize a result of Frobenius and various necessary properties of such groups, combined with Plesken and Holt's extensive enumeration of finite perfect groups, to systematically examine all finite groups up to a certain order for the desired property. The computational core of our work is implemented using the computer system GAP (Groups, Algorithms, and Programming). We discover two nonisomorphic groups of order 368,640 that exhibit the desired property. Our investigation also establishes that this order is the minimum order for such a group to exist. As a result, this study provides a positive answer to Problem 17.76 in the Kourovka Notebook. In addition to the algorithmic framework, this paper provides a structural description of one of the two groups found.

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

↑