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

把Weisfeiler-Leman推广为群同构算法

Incorporating Weisfeiler-Leman into algorithms for group isomorphism

Peter A. Brooksbank, Joshua A. Grochow, Yinan Li, Youming Qiao, James B. Wilson

摘要:

在本文中,我们结合了许多标准的和最近的代数技术测试同构的有限群(GPI)与组合技术,通常已被应用到图同构。特别地,我们展示了如何将用于特定组类的几种最先进的GpI算法组合成用于一般GpI的算法,即:2015; Luks,2015),递归可细化滤波器(Wilson,J. Group Theory,2013)和低亏格GpI(Brooksbank-Maglione-Wilson,J. Algebra,2017)。递归细化过滤器-一个泛化的子群系列-形成这个框架的骨架,我们完善我们的过滤器通过建立一个超图编码低属的concurents,然后我们应用超图的变体的k维Weisfeiler-Leman技术。我们的技术是足够灵活的,很容易将额外的超图不变量或额外的特征子群。

英文摘要:

In this paper we combine many of the standard and more recent algebraic techniques for testing isomorphism of finite groups (GpI) with combinatorial techniques that have typically been applied to Graph Isomorphism. In particular, we show how to combine several state-of-the-art GpI algorithms for specific group classes into an algorithm for general GpI, namely: composition series isomorphism (Rosenbaum-Wagner, Theoret. Comp. Sci., 2015; Luks, 2015), recursively-refineable filters (Wilson, J. Group Theory, 2013), and low-genus GpI (Brooksbank-Maglione-Wilson, J. Algebra, 2017). Recursively-refineable filters -- a generalization of subgroup series -- form the skeleton of this framework, and we refine our filter by building a hypergraph encoding low-genus quotients, to which we then apply a hypergraph variant of the k-dimensional Weisfeiler-Leman technique. Our technique is flexible enough to readily incorporate additional hypergraph invariants or additional characteristic subgroups.

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

↑