An excess theorem for spherical 2-designs

Hirotake Kurihara

REVIEW

An excess theorem for spherical 2-designs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1203.3257 v1 pith:G5DDZJDL submitted 2012-03-15 math.CO

An excess theorem for spherical 2-designs

Hirotake Kurihara This is my paper

classification math.CO

keywords excesstheoremdesignsgraphssphericalcharacterizationgiveassociation

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original 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.

An excess theorem for spherical 2-designs

discussion (0)