Pith. sign in

REVIEW 2 major objections 5 minor 14 references

Primitive weakly distance-regular circulant digraphs

T0 review · 2 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read The paper classifies all primitive weakly distance-regular circulant digraphs: Paley digraphs, prime circuits, and Cay(Z13,{1,3,9}).

desk verdict Clean classification of primitive weakly distance-regular circulant digraphs; a solid paper whose one load-bearing external citation needs verification. read the letter →

arxiv 1908.08658 v1 pith:DESFXEU6 submitted 2019-08-23 math.CO

Akihiro Munemasa , Kaishun Wang , Yuefeng Yang This is my paper · ORCID
classification math.CO MSC 05E30
keywords associationschemepseudocyclicCayleydigraphweaklydistance-regularprimitivitycirculantcyclotomic
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper gives a complete list of the primitive weakly distance-regular circulant digraphs: strongly connected Cayley digraphs on cyclic groups whose two-way distance classes form an association scheme, namely the Paley digraph on a prime number $p$ of vertices with $p \equiv 3 \pmod{4}$, the directed cycle (circuit) of prime length $p$, and one exceptional Cayley digraph on 13 vertices with connection set $\{1, 3, 9\}$. This is the directed analogue of the known classification of distance-regular circulant graphs, and it proceeds by classifying the attached association schemes rather than the digraphs alone. The authors first prove Theorem 1.1: a commutative association scheme generated by a non-symmetric relation satisfying three local closure conditions, with equal nontrivial valencies greater than 1, has exactly four classes, and if it is pseudocyclic it is the cyclotomic scheme $\mathrm{Cyc}(13, 4)$. They then show that the attached scheme of any primitive weakly distance-regular circulant digraph satisfies those hypotheses, so the digraph classification follows. The result shows that no further exotic primitive examples exist in the circulant case, and it provides a concrete bridge between weakly distance-regular digraphs and association schemes.

What carries the argument

The load-bearing object is the attached scheme $X(\Gamma) = (V\Gamma, \{\Gamma_{\tilde{i}}\}_{\tilde{i} \in \tilde{\partial}(\Gamma)})$, the association scheme whose relations group vertex pairs by their two-way distance $(\partial(x,y), \partial(y,x))$. For a circulant digraph this is a translation scheme, so its relations are invariant under translations of the cyclic group and its adjacency matrices commute. The argument uses two further mechanisms: the external classification of primitive translation schemes cited in Lemma 4.1, which turns the circulant problem into a problem about cyclotomic schemes over a prime field (schemes whose relations are the cosets of a subgroup of the field's multiplicative group), and a set-scaling argument (Lemma 4.2) that, for a circuit $x_0, x_1, \ldots, x_{g-1}$ of type $(1, g-1)$, expresses the set $Y_i = P_{(1,g-1),(1,g-1)}(x_{i-1}, x_{i+1})$ as $Y_i = iY_1$, forcing $g = p$ and hence a circuit unless $g = 3$. The small intersection-number calculus of Theorem 1.1 then leaves exactly the 13-vertex cyclotomic scheme.

What would settle it

A concrete falsifier: compute the attached association scheme of any weakly distance-regular Cayley digraph on $\mathbb{Z}_p$ for $p > 13$ prime; if it is primitive and has more than two two-way distance classes, Theorem 1.3 is false. In particular, the proof's Step 2 implies that a counterexample of girth $g > 3$ would force $p = g$, so a search should focus on girth-3 candidates.

Watch

Extended reading notes

Core claim

The central discovery is Theorem 1.3: a digraph $\Gamma$ is a primitive weakly distance-regular circulant digraph if and only if $\Gamma$ is isomorphic to (i) the Paley digraph of order $p$, where $p$ is prime and $p \equiv 3 \pmod{4}$; (ii) the circuit of length $p$, where $p$ is prime; or (iii) $\mathrm{Cay}(\mathbb{Z}_{13}, \{1, 3, 9\})$. The proof runs through the attached scheme $X(\Gamma)$, whose relations are the two-way distance classes of $\Gamma$. Because $\Gamma$ is circulant, $X(\Gamma)$ is a translation scheme on a cyclic group; because it is primitive in the association-scheme sense (every non-diagonal relation generates the scheme), an external theorem (Lemma 4.1) forces the group to have prime order and the scheme to be cyclotomic. The cyclotomic structure lets the authors rule out girth greater than 3: if a circuit of type $(1, g-1)$ with $g > 3$ existed, field multiplication would force a set identity $Y_i = iY_1$ and eventually $p = g$, making $\Gamma$ a circuit, contrary to the standing assumption. With girth 3, the relation $R_1 = \Gamma_{(1,2)}$ and $R_2 = \Gamma_{(2,3)}$ satisfy conditions (1)--(3) of Theorem 1.1, and the pseudocyclic case forces the 13-point cyclotomic scheme, giving the exceptional digraph. The Paley and circuit cases correspond to the 2-class schemes.

Load-bearing premise

The entire classification rests on the cited theorem that a primitive translation scheme on a cyclic group must have prime order and be cyclotomic; if the attached schemes of these digraphs fail that theorem's hypotheses, the reduction that drives the proof collapses.

Editorial extensions

If this is right

  • Every primitive weakly distance-regular circulant digraph has either two two-way distance classes (Paley or circuit) or four two-way distance classes (the 13-vertex exceptional case); no other class numbers occur.
  • The vertex count of any such digraph is prime: $p$ for Paley digraphs and circuits, and 13 for the exceptional case, because the attached scheme must be cyclotomic over a prime field.
  • The exceptional digraph $\mathrm{Cay}(\mathbb{Z}_{13}, \{1, 3, 9\})$ is not an ad hoc example; it is forced by the classification of pseudocyclic skew-symmetric 4-class association schemes.
  • The first part of Theorem 1.1 holds without the pseudocyclicity assumption up to the conclusion $d = 4$; only the identification with $\mathrm{Cyc}(13, 4)$ needs pseudocyclicity.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because the reduction to cyclotomic schemes runs through cyclic Sylow subgroups, the natural next target is primitive weakly distance-regular Cayley digraphs over other finite abelian groups; whether an analogue of Lemma 4.1 exists there would decide if the same three-family picture persists.
  • The exceptional connection set $\{1, 3, 9\}$ modulo 13 is a cyclotomic coset of index 4 in $\mathbb{Z}_{13}^{\times}$; this suggests testing computationally whether similar cyclotomic-coset Cayley digraphs over larger prime fields produce any weakly distance-regular examples, which the theorem says they cannot in the primitive circulant setting.
  • The paper notes in Remark 3.7 that no example is known for one subcase of Theorem 1.1; since such a scheme would not be pseudocyclic, it could not arise as the attached scheme of a circulant digraph, so the digraph classification does not depend on resolving that open case.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 5 minor

Summary. The paper proves two classification theorems. Theorem 1.1 analyzes commutative association schemes generated by a non-symmetric relation R1 satisfying R1^2 ⊆ {R1,R1*,R2}, R1R1* ⊆ {R0,R1,R1*,R2,R2*}, and 2 not in {1*,2*}; it concludes that if k1=k2>1 then d=4, and that if the scheme is pseudocyclic then it is isomorphic to the cyclotomic scheme Cyc(13,4). Theorem 1.3 applies this scheme theory to classify primitive weakly distance-regular circulant digraphs, obtaining the Paley digraph of prime order p≡3 mod 4, the directed circuit of prime length p, and Cay(Z13,{1,3,9}). The proof of Theorem 1.3 shows that the attached scheme of such a digraph is a primitive translation scheme, invokes Lemma 4.1 to conclude that it is cyclotomic over GF(p), and then uses the case analysis of Theorem 1.1.

Significance. If correct, the paper gives a complete classification of primitive weakly distance-regular circulant digraphs, a natural directed analogue of the Miklavic-Potocnik classification of distance-regular circulants. Theorem 1.1 is a substantial and mostly self-contained piece of intersection-number case analysis, and the use of the independent classifications in [4] and [5] is appropriate. The proof of Theorem 1.3 is elegant in its reduction to girth 3 and to the cyclotomic case. However, the bridge from translation schemes to cyclotomic schemes is exactly one cited theorem whose exact hypotheses are not stated, and a related skew-symmetry assertion is not justified by the definitions given. These issues are load-bearing for the main classification, though they appear fixable.

major comments (2)
  1. [Section 4, proof of Theorem 1.3] Lemma 4.1 is cited as [2, Theorem 2.10.5] without quoting the theorem or its hypotheses. The cited monograph [2] is about distance-regular graphs, and the paper does not show that the attached scheme X(Γ) is the distance-layer scheme of a distance-regular graph, nor that the cited result applies to arbitrary primitive translation schemes. Since the rest of the proof of Theorem 1.3 depends on the conclusion that X is a cyclotomic scheme over GF(p), the authors should state the theorem in full, specify the group whose Sylow subgroup is assumed cyclic, and prove that all hypotheses are met by X(Γ). Without this, the reduction in Section 4 is unsupported.
  2. [Section 4] The assertion that a cyclotomic scheme is necessarily skew-symmetric is false under the definition in Section 2. For example, Cyc(5,2) is cyclotomic and primitive, but its non-diagonal relations are symmetric because -1 lies in the subgroup used to define the classes. The skew-symmetry of X(Γ) is used in Steps 3 and 4 to identify relations and to verify condition (3) of Theorem 1.1. The authors need to replace this implication with a proof specific to weakly distance-regular circulant digraphs, or else state explicitly that Lemma 4.1 is being used in a stronger sense than the definition of cyclotomic scheme given in Section 2.
minor comments (5)
  1. [Theorem 1.3] There is a typo in the statement: 'primitve' should be 'primitive'.
  2. [Section 4, Steps 1 and 2] The girth of a digraph is used repeatedly but is never defined in the preliminaries; please add a definition for a strongly connected digraph.
  3. [Lemma 4.2] The notation P_{(a,b),(c,d)} is used for two-way distance classes, but the earlier definition of P_{i,j} in Section 1 concerns scheme relations. Please define the two-way-distance version explicitly.
  4. [Section 3.2, Case 1] The proof of the claim that I={1,1*} is terse: the strict inclusion in the display is asserted without identifying the vertex that witnesses the strictness. Please supply the missing argument for the reader.
  5. [Reference [13]] The reference title contains a typo: 'Assoication Schemes' should be 'Association Schemes'.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the derivation rests on external classification theorems and intersection-number identities, not on its own target.

full rationale

The main classification (Theorem 1.3) is not circular. The attached scheme of a circulant weakly distance-regular digraph is a translation scheme by direct observation, and Lemma 4.1 is quoted from the external monograph [2]; whether that theorem's hypotheses exactly match translation schemes is a correctness question, not a circularity. The subsequent steps use only properties of cyclotomic schemes (Lemma 2.2), standard intersection-number identities (Lemma 2.1), and combinatorial arguments to verify the hypotheses of Theorem 1.1. Theorem 1.1's second statement is delegated to Lemma 2.3, which in turn uses [5, Theorem 3.3] and [4, Result 1]. Although [5] is coauthored by K. Wang, it is a prior, independent classification of four-class skew-symmetric association schemes, and nothing in the present paper defines or tautologically assumes that classification as its target. No parameter is fitted and renamed a prediction, and no equation is used both as input and as output. Thus no circular step is exhibited.

Assumptions & free parameters 0 free parameters · 6 assumptions · 0 invented entities

No free parameters are fitted. The proof is a combinatorial classification that relies on standard association-scheme identities and on three external classification results ([2, Thm 2.10.5], [4], [5]). These external results are independent of the present theorem and are not assumed to be the target conclusion.

assumptions (6)
  • standard math A d-class association scheme satisfies the four standard axioms: diagonal relation, partition, transpose, and constant intersection numbers.
    Used throughout; this is the standard definition from [1,13,14].
  • standard math The attached scheme X(Gamma) of a weakly distance-regular digraph is an association scheme.
    This is the definition of weakly distance-regular given in [8] and used in the proof of Theorem 1.3.
  • domain assumption Lemma 4.1 ([2, Theorem 2.10.5]): a primitive translation scheme with a cyclic Sylow subgroup has prime order and is cyclotomic.
    This external theorem is the load-bearing bridge that reduces primitive circulant weakly distance-regular digraphs to cyclotomic schemes over GF(p). The paper does not reproduce its statement or proof.
  • domain assumption Ma-Wang classification of four-class skew-symmetric schemes and the parameter formulas |X|=u^2+4v^2 and p_{2*,1,1}=... used in Lemma 2.3.
    External result [5, Theorem 3.3] is used to force |X|=13 in the pseudocyclic case.
  • domain assumption Hirasaka-Suga classification of association schemes with 13 points says the unique candidate is Cyc(13,4).
    External classification [4, Result 1] identifies the exceptional scheme in Lemma 2.3 and Theorem 1.3.
  • standard math The intersection-number identities in Lemma 2.1 hold for commutative association schemes.
    Quoted from [1, Chapter II, Proposition 2.2] and used throughout Lemma 3.1.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Primitive weakly distance-regular circulant digraphs." pith.science (2026). https://pith.science/paper/DESFXEU6

@misc{pith2026190808658,
  author       = {Pith},
  title        = {Pith review of: Primitive weakly distance-regular circulant digraphs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/DESFXEU6}},
  note         = {Machine review of arXiv:1908.08658}
}
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.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

14 extracted references · 14 canonical work pages

  1. [4]

    Hirasaka and Y

    M. Hirasaka and Y. Suga, The classification of association scheme s with 13 or 15 points, Proceedings of Kyoto Univ. Res. Inst. Math. Sci. 962 (1996) 71–8 0

    work page 1996

  2. [5]

    Ma and K

    J. Ma and K. Wang, Four-class skew-symmetric association sche mes, J. Combin. Theory Ser. A 118 (2011) 1381–1391

    work page 2011

  3. [2]

    Brouwer, A.M

    A.E. Brouwer, A.M. Cohen and A. Neumaier, Distance-Regular Gra phs, Springer- Verlag, New York, 1998. PRIMITIVE WEAKLY DISTANCE-REGULAR CIRCULANT DIGRAPHS 11

    work page 1998

  4. [1]

    Bannai and T

    E. Bannai and T. Ito, Algebraic Combinatorics I: Association Sch emes, Ben- jamin/Cummings, California, 1984

    work page 1984

  5. [3]

    van Dam, J.H

    E.R. van Dam, J.H. Koolen and H. Tanaka, Distance-regular graph s, Electron. J. Com- bin. (2016) DS22

    work page 2016

  6. [6]

    Miklavi´ c and P

    S. Miklavi´ c and P. Potoˇ cnik, Distance-regular circulants, European J. Combin. 24 (2003) 777–784

    work page 2003

  7. [7]

    Suzuki, Thin weakly distance-regular digraphs, J

    H. Suzuki, Thin weakly distance-regular digraphs, J. Combin. The ory Ser. B 92 (2004) 69–83

    work page 2004

  8. [8]

    Wang and H

    K. Wang and H. Suzuki, Weakly distance-regular digraphs, Discre te Math. 264 (2003) 225–236

    work page 2003

Show all 14 references
  1. [9]

    Wang, Commutative weakly distance-regular digraphs of girth 2, European J

    K. Wang, Commutative weakly distance-regular digraphs of girth 2, European J. Com- bin. 25 (2004) 363–375

    2004

  2. [10]

    Y. Yang, B. Lv and K. Wang, Weakly distance-regular digraphs o f valency three, I, Electron. J. Combin. 23(2) (2016), Paper 2.12

    2016

  3. [11]

    Y. Yang, B. Lv and K. Wang, Weakly distance-regular digraphs o f valency three, II, J. Combin. Theory Ser. A 160 (2018) 288–315

    2018

  4. [12]

    Y. Yang, B. Lv and K. Wang, Quasi-thin weakly distance-regular digraphs, J. Algebraic Combin. DOI: 10.1007/s10801-018-0866-7

    doi

  5. [13]

    Zieschang, An Algebraic Approach to Assoication Schemes, in: Lecture Notes in Mathematics, Vol.1628, Springer, Berlin, Heidelberg, 1996

    P.H. Zieschang, An Algebraic Approach to Assoication Schemes, in: Lecture Notes in Mathematics, Vol.1628, Springer, Berlin, Heidelberg, 1996

    1996

  6. [14]

    Zieschang, Theory of Association Schemes, Springer Mono graph in Mathematics, Springer, Berlin, 2005

    P.H. Zieschang, Theory of Association Schemes, Springer Mono graph in Mathematics, Springer, Berlin, 2005. Research Center for Pure and Applied Mathematics, Graduate School of Information Sciences, Tohoku University, Sendai, 980–857 9, Japan E-mail address : munemasa@math.is.t...

    2005

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.