Primitive weakly distance-regular circulant digraphs

Akihiro Munemasa; Kaishun Wang; Yuefeng Yang

REVIEW

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 1908.08658 v1 pith:DESFXEU6 submitted 2019-08-23 math.CO

Primitive weakly distance-regular circulant digraphs

Akihiro Munemasa , Kaishun Wang , Yuefeng Yang This is my paper

classification math.CO

keywords circulantdigraphsdistance-regularprimitiveweaklyapplicationassociationcertain

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

0 comments

read the original abstract

We classify certain non-symmetric commutative association schemes. As an application, we determine all the primitive weakly distance-regular circulant digraphs.

Primitive weakly distance-regular circulant digraphs

discussion (0)