2000 character limit reached
An excess theorem for spherical 2-designs
Published 15 Mar 2012 in math.CO | (1203.3257v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.