On the Weisfeiler-Leman dimension of finite groups

DOI10.1145/3373718.3394786zbMATH Open1498.20002arXiv2003.13745OpenAlexW3031462399MaRDI QIDQ5145641FDOQ5145641

Authors: Jendrik Brachter, P. Schweitzer 

Publication date: 21 January 2021

Published in: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Abstract: In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we define the Weisfeiler-Leman algorithm for groups. In fact we define three versions of the algorithm. In contrast to graphs, where the three analogous versions readily agree, for groups the situation is more intricate. For groups, we show that their expressive power is linearly related. We also give descriptions in terms of counting logics and bijective pebble games for each of the versions. In order to construct examples of groups, we devise an isomorphism and non-isomorphism preserving transformation from graphs to groups. Using graphs of high Weisfeiler-Leman dimension, we construct highly similar but non-isomorphic groups with equal $Theta(sqrtlogn)$-subgroup-profiles, which nevertheless have Weisfeiler-Leman dimension 3. These groups are nilpotent groups of class 2 and exponent $p$, they agree in many combinatorial properties such as the combinatorics of their conjugacy classes and have highly similar commuting graphs. The results indicate that the Weisfeiler-Leman algorithm can be more effective in distinguishing groups than in distinguishing graphs based on similar combinatorial constructions.

Full work available at URL: https://arxiv.org/abs/2003.13745

Recommendations

• The Weisfeiler-Leman algorithm and recognition of graph properties
• On Weisfeiler-Leman invariance: subgraph counts and related graph properties
• The Weisfeiler-Leman algorithm and recognition of graph properties
• Isomorphism testing for embeddable graphs through definability
• The Weisfeiler--Leman Dimension of Planar Graphs Is at Most 3

zbMATH Keywords

group isomorphismWeisfeiler-Leman dimensionlogics with countingCai-Frer-Immermann graphs

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Model theory of finite structures (03C13) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Computational methods for problems pertaining to group theory (20-08)

Cited In (6)

• On multidimensional Schur rings of finite groups
• Connections between graphs and matrix spaces
• Tuple regularity and \(\mathrm{k} \)-ultrahomogeneity for finite groups
• Faster isomorphism for \(p\)-groups of class 2 and exponent \(p\)
• Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting)
• Count-free Weisfeiler-Leman and group isomorphism

This page was built for publication: On the Weisfeiler-Leman dimension of finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145641)