Weighted association schemes, fusions, and minimal coherent closures
A weighted association scheme is a scheme with an edge weight function, which for our purposes will take values \({\pm }1\). When the scheme has a coherent fusiona merging of classes resulting in another association schemethe edge weights on the fusion scheme are inherited. The reverse process involves the coherent closure of a weighted scheme: the smallest coherent algebra containing the weighted adjacency matrices. The weight function applied to this closure is necessarily trivial, meaning constant on classes of the associated configuration. In this work there are two main objects of study: minimal rank coherent closures of strongly regular graphs with regular weights; and strongly regular graphs with regular weights which are obtained as fusions of association schemes with trivial regular weights. Both of these extend work of D. Taylor on regular two-graphs and their interactions with strongly regular graphs. We obtain regular weights on strongly regular graphs with 125 and 256 vertices as fusions of rank 5 weighted schemes, and a family of rank 6, primitive, non-metric schemes which are minimal-rank closures of weighted lattice graphs. Our main result is the classification of these coherent closures of rank 4. They are imprimitive rank 4 association schemes, which have been studied generally by E. R. van Dam, and Y. Chang and T. Huang.
association scheme coherent closure regular weight coherent configuration weisfeilerlehman stabilization 05c12 05c22 05c50 05e30