{"title":"On the Weisfeiler algorithm of depth-1 stabilization","authors":"Gang Chen , Qing Ren , Ilia Ponomarenko","doi":"10.1016/j.tcs.2025.115460","DOIUrl":null,"url":null,"abstract":"<div><div>An origin of the multidimensional Weisfeiler-Leman algorithm goes back to a refinement procedure of deep stabilization, introduced by B. Weisfeiler in a paper included in the collective monograph “On construction and identification of graphs” (1976). This procedure is recursive and the recursion starts from an algorithm of depth-1 stabilization, which has never been discussed in the literature.</div><div>A goal of the present paper is to show that a simplified algorithm of the depth-1 stabilization has the same power as the 3-dimensional Weisfeiler-Leman algorithm. It is proved that the class of coherent configurations obtained as the output of this simplified algorithm coincides with the class introduced earlier by the third author. As an application we also prove that if there exist at least two nonisomorphic projective planes of order <em>q</em>, then the Weisfeiler-Leman dimension of the incidence graph of any projective plane of order <em>q</em> is at least 4.</div></div>","PeriodicalId":49438,"journal":{"name":"Theoretical Computer Science","volume":"1054 ","pages":"Article 115460"},"PeriodicalIF":1.0000,"publicationDate":"2025-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Theoretical Computer Science","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0304397525003986","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
An origin of the multidimensional Weisfeiler-Leman algorithm goes back to a refinement procedure of deep stabilization, introduced by B. Weisfeiler in a paper included in the collective monograph “On construction and identification of graphs” (1976). This procedure is recursive and the recursion starts from an algorithm of depth-1 stabilization, which has never been discussed in the literature.
A goal of the present paper is to show that a simplified algorithm of the depth-1 stabilization has the same power as the 3-dimensional Weisfeiler-Leman algorithm. It is proved that the class of coherent configurations obtained as the output of this simplified algorithm coincides with the class introduced earlier by the third author. As an application we also prove that if there exist at least two nonisomorphic projective planes of order q, then the Weisfeiler-Leman dimension of the incidence graph of any projective plane of order q is at least 4.
期刊介绍:
Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.