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

求有限群最小生成集的一个算法

An algorithm for finding minimal generating sets of finite groups

Tanakorn Udomworarat, Teerapong Suksumran

摘要:

本文研究Cayley图$\mathrm{Cay}(G,A)$(其中$A$是群$G$的任意子集)的分支与由$A$生成的$G$的子群的陪集之间的联系.特别是,我们展示了如何构建生成集的$G$,如果$\mathrm{Cay}(G,A)$有许多组件。此外,我们还提供了一个利用Cayley图求有限群的最小生成集的算法。

英文摘要:

In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct generating sets of $G$ if $\mathrm{Cay}(G,A)$ has finitely many components. Furthermore, we provide an algorithm for finding minimal generating sets of finite groups using their Cayley graphs.

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

↑