A characterization of Q-polynomial association schemes

REVIEW

Not yet reviewed by Pith; the record is open.

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 1007.0473 v2 pith:E7K25S4X submitted 2010-07-03 math.CO

Hirotake Kurihara , Hiroshi Nozaki This is my paper

classification math.CO

keywords associationq-polynomialschemecharacterizationconditionnecessaryproveschemes

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

0 comments

read the original abstract

We prove a necessary and sufficient condition for a symmetric association scheme to be a Q-polynomial scheme.