首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On a New High Dimensional Weisfeiler-Lehman Algorithm
Authors:Sergei Evdokimov  Marek Karpinski  Ilia Ponomarenko
Institution:(1) Academy of Sciences, St. Petersburg Institute for Informatics and Automation, Russia;(2) Department of Computer Science, University of Bonn, Germany
Abstract:We investigate the following problem: how different can a cellular algebra be from its Schurian closure, i.e., the centralizer algebra of its automorphism group? For this purpose we introduce the notion of a Schurian polynomial approximation scheme measuring this difference. Some natural examples of such schemes arise from high dimensional generalizations of the Weisfeiler-Lehman algorithm which constructs the cellular closure of a set of matrices. We prove that all of these schemes are dominated by a new Schurian polynomial approximation scheme defined by the m-closure operators. A sufficient condition for the m-closure of a cellular algebra to coincide with its Schurian closure is given.
Keywords:graph isomorphism problem  cellular algebra  permutation group
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号