Homogeneous coherent configurations from spherical buildings and other edge-coloured graphs
Pierre Guillot

TL;DR
This paper generalizes the concept of distance-regular graphs to a broader class of edge-coloured graphs, including buildings and affine planes, establishing new links between their algebraic structures and symmetry properties.
Contribution
It introduces a framework for constructing coherent configurations from edge-coloured graphs with a distance function, extending classical association scheme theory to new geometric contexts.
Findings
Bose-Mesner algebra is isomorphic to the adjacency algebra of the graph.
Strong transitivity implies the existence of a canonical distance function.
Affine planes with strongly transitive groups are necessarily Desarguesian.
Abstract
We study a class of edge-coloured graphs, including the chamber systems of buildings and other geometries such as affine planes, from which we build coherent configurations (also known as non-commutative association schemes). The condition we require is that the graph be endowed with a certain distance function, taking its values in the adjacency algebra (itself generated by the adjacency operators). When all the edges are of the same colour, the condition is equivalent to the graph being distance-regular, so our result is a generalization of the classical fact that distance-regular graphs give rise to association schemes. The Bose-Mesner algebra of the coherent configuration is then isomorphic to the adjacency algebra of the graph. The latter is more easily computed, and comes with a "small" set of generators, so we are able to produce examples of Bose-Mesner algebras with…
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
TopicsAdvanced Topics in Algebra · Finite Group Theory Research · Algebraic structures and combinatorial models
