An excess theorem for spherical 2-designs
Combinatorics
2012-03-16 v1
Abstract
We give an excess theorem for spherical 2-designs. This theorem is a dual version of the spectral excess theorem for graphs, which gives a characterization of distance-regular graphs, among regular graphs in terms of the eigenvalues and the excess. Here we give a characterization of Q-polynomial association schemes among spherical 2-designs.
Cite
@article{arxiv.1203.3257,
title = {An excess theorem for spherical 2-designs},
author = {Hirotake Kurihara},
journal= {arXiv preprint arXiv:1203.3257},
year = {2012}
}
Comments
10 pages, no figure