English

On the Weisfeiler algorithm of depth-$1$ stabilization

Combinatorics 2023-11-17 v1

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-11 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-11 stabilization has the same power as the 33-dimensional Weisfeiler-Leman algorithm. It is proved that the class of coherent configurations obtained at 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 qq, then the Weisfeiler-Leman dimension of the incidence graph of any projective plane of order qq is at least 44.

Cite

@article{arxiv.2311.09940,
  title  = {On the Weisfeiler algorithm of depth-$1$ stabilization},
  author = {Gang Chen and Qing Ren and Ilia Ponomarenko},
  journal= {arXiv preprint arXiv:2311.09940},
  year   = {2023}
}

Comments

24 pages

R2 v1 2026-06-28T13:23:28.293Z