Fetching the paper…
Reading the bibliography…
We give an excess theorem for spherical 2-designs.
Regular Polytopes
H. S. M. Coxeter · 1973
Earlier work this paper cites.
Spherical codes and designs
P. Delsarte, J. M. Goethals, and J. J. Seidel · 1977
Earlier work this paper cites.
The Krein condition, spherical designs, Norton algebras and permutation groups
P. J. Cameron, J. M. Goethals, and J. J. Seidel · 1978
Earlier work this paper cites.
Spectra of graphs
D. M. Cvetković, M. Doob, and H. Sachs · 1980
Earlier work this paper cites.
Algebraic combinatorics. I
E. Bannai and T. Ito · 1984
Cited alongside, same era.
Polynomial spaces
C. D. Godsil · 1989
Cited alongside, same era.
Algebraic combinatorics
C. D. Godsil · 1993
Cited alongside, same era.
From local adjacency polynomials to locally pseudo-distance-regular graphs
M. A. Fiol and E. Garriga · 1997
Cited alongside, same era.
Distance-regular graphs
A. E. Brouwer, A. M. Cohen, and A. Neumaier
Cited in the paper.
The spectral excess theorem for distance-regular graphs: a global (over)view
E. R. van Dam · 2008
Later among the works it cites.
A survey on spherical designs and algebraic combinatorics on spheres
Ei. Bannai and Et. Bannai · 2009
Later among the works it cites.
A simple proof of the spectral excess theorem for distance-regular graphs
M. A. Fiol, S. Gago, and E. Garriga · 2010
Later among the works it cites.
A characterization of Q Q -polynomial association schemes
H. Kurihara and H. Nozaki · 2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…