On Q-polynomial association schemes of small class
classification
🧮 math.CO
keywords
associationclasspolynomialschemesthreeappliedcharacterizedistance-regular
read the original abstract
We show an inequality involving the third largest or second smallest dual eigenvalues of $Q$-polynomial association schemes of class at least three. Also we characterize dual-tight $Q$-polynomial association schemes of class three. Our method is based on tridiagonal matrices and can be applied to distance-regular graphs as well.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.