A characterization of Q-polynomial association schemes
classification
🧮 math.CO
keywords
associationq-polynomialschemecharacterizationconditionnecessaryproveschemes
read the original abstract
We prove a necessary and sufficient condition for a symmetric association scheme to be a Q-polynomial scheme.
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.