A matrix equation for association schemes
Laura M. Chihara, Dennis W. Stanton
Abstract
Let X be a self-dual P-polynomial association scheme. Then there are at most 12 diagonal matrices T such that (PT)3=I. Moreover, all of the solutions for the classical infinite families of such schemes (including the Hamming scheme) are classified.
Create a lesson
Related papers
Fractional colorings of Kr-free graphs with local demands
Ewan Davies, Abhishek Dhawan, Abhishek Methuku et al.
Short permutation pattern waves: The complete length-five classification
Lihong Qiu, Minglei Mao, Yaping Mao
Automatic partition identities
Laurent Bartholdi
Well-Covered Powers: Cartesian Products and Cayley Graphs
Haobo Ma, Thanh Vu, Wenlin Zhang
Lemmas and Conjectures in Spectral Graph Theory
Tristan Cazenave
On the lower- and upper bounds of three-colored anti-Ramsey numbers
Máté Giesz