On a family of divisible design digraphs
Mikhail Muzychuk, Grigory Ryabov

TL;DR
This paper constructs a family of highly symmetric Cayley digraphs over Heisenberg groups, revealing their indistinguishability by the Weisfeiler-Leman algorithm and establishing their Weisfeiler-Leman dimension as 3.
Contribution
It introduces a new family of divisible design Cayley digraphs with specific symmetry properties and analyzes their Weisfeiler-Leman algorithm behavior.
Findings
Digraphs are pairwise nonisomorphic and normal arc-transitive.
Neighborhood designs are isomorphic over the Heisenberg group.
Digraphs are not distinguished by the Weisfeiler-Leman algorithm, with WL dimension 3.
Abstract
For every odd prime power , a family of pairwise nonisomorphic normal arc-transitive divisible design Cayley digraphs with isomorphic neighborhood designs over a Heisenberg group of order is constructed. It is proved that these digraphs are not distinguished by the Weisfeiler-Leman algorithm and have the Weisfeiler-Leman dimension .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems
