A characterization of Q-polynomial association schemes
Combinatorics
2011-06-14 v2
Abstract
We prove a necessary and sufficient condition for a symmetric association scheme to be a Q-polynomial scheme.
Cite
@article{arxiv.1007.0473,
title = {A characterization of Q-polynomial association schemes},
author = {Hirotake Kurihara and Hiroshi Nozaki},
journal= {arXiv preprint arXiv:1007.0473},
year = {2011}
}
Comments
8 pages, no figure