Distance-regular graphs, the subconstituent algebra, and the $Q$-polynomial property

Paul Terwilliger

Distance-regular graphs, the subconstituent algebra, and the $Q$-polynomial property

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 2207.07747 v2 pith:ZNJPGXYP submitted 2022-07-15 math.CO math.QA

Paul Terwilliger This is my paper · ORCID

classification math.COmath.QA

keywords algebradistance-regulargraphspolynomialpropertysubconstituentcontainsemphasis

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

abstract

This survey paper contains a tutorial introduction to distance-regular graphs, with an emphasis on the subconstituent algebra and the $Q$-polynomial property.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Circular Hessenberg pairs and the tridiagonal relations
math.CO 2026-07 accept novelty 6.0 of 10

Every circular Hessenberg pair on a finite-dimensional vector space satisfies the two tridiagonal relations.

Pith tools