Pith. sign in

REVIEW 2 major objections 6 minor 20 references

$d$-orthogonal polynomials, Fuss-Catalan matrices and lattice paths

T0 review · 2 major / 6 minor · reviewed 2026-08-07 · deepseek-v4-flash

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

Pith's one-line read The Fuss-Catalan triangles are Riordan arrays built from d-orthogonal polynomials, and the paper proves a closed binomial formula for every entry of the underlying pre-Fuss-Catalan array.

desk verdict Solid Riordan-array arithmetic; the d-orthogonal framing for general r needs a proof or a citation. read the letter →

arxiv 2505.16718 v1 pith:4AQ4X7SQ submitted 2025-05-22 math.CO

Paul Barry This is my paper · ORCID
classification math.CO MSC 05A1515B3611B3711B8311C2042C0511Y55
keywords CatalannumberFuss-CatalannumbersRiordanarraygeneratingfunctiond-orthogonalpolynomialsintegersequenceslatticepathproductionmatrix
topics The Collatz Conjecture
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

This paper establishes that the Fuss-Catalan number triangles are Riordan arrays carrying a hidden d-orthogonal polynomial structure. It defines the pre-Fuss-Catalan-Riordan array as the inverse of $\left(\frac{1}{1+x},\frac{x}{(1+x)^r}\right)$, proves a closed binomial form for every entry, and shows that the Fuss-Catalan-Riordan array factors into this moment array and a simple binomial-type array. Because the production matrices of these arrays are banded, the arrays serve as the coefficient arrays of constant-coefficient d-orthogonal polynomial recurrences, and the same matrices count lattice paths with two-step step sets. If correct, this gives a uniform generating-function explanation for the Fuss-Catalan triangles and a template for parameterized generalizations.

What carries the argument

The load-bearing object is the Riordan array $(g(x),f(x))$, defined by entries $t_{n,k}=[x^n]g(x)f(x)^k$, together with its A-sequence and Z-sequence characterization: a lower-triangular array is Riordan exactly when its production matrix $P=M^{-1}\overline{M}$ has the banded form determined by those two sequences. The specific engine is the functional equation $g_r(x)=1+xg_r(x)^r$ for Fuss-Catalan generating functions; Lagrange inversion converts this equation into the explicit binomial coefficient formula for $\tau_{n,k}$, and the A/Z-sequence calculus converts banded production matrices into constant-coefficient d-orthogonal polynomial recurrences. The factorization identity of Proposition 16 is what links the d-orthogonal moment array to the Fuss-Catalan array.

What would settle it

For $r=4$, Proposition 13 predicts that the $(4,1)$ entry of $\left(\frac{1}{1+x},\frac{x}{(1+x)^4}\right)^{-1}$ is $\frac{5}{14}\binom{16}{3}=200$; inverting the $5\times5$ truncation of that array and checking the $(4,1)$ position, or verifying the factorization of Proposition 16 on the $5\times5$ truncations for $r=3$, would settle the central formulas.

Watch

Extended reading notes

Core claim

The central claim is that the inverse Riordan array $\left(\frac{1}{1+x},\frac{x}{(1+x)^r}\right)^{-1}$, called the pre-Fuss-Catalan-Riordan array, has entries $\tau_{n,k}=\frac{rk+1}{(r-1)n+k+1}\binom{rn}{n-k}$, and that the Fuss-Catalan-Riordan array $(g_r(x),xg_r(x))$ factors as $(g_r(x),xg_r(x))=(g_r(x),xg_r(x)^r)\cdot\left(1,\frac{x}{(1+x)^{r-1}}\right)$, where $g_r(x)=1+xg_r(x)^r$ is the generating function of the $r$-th Fuss-Catalan numbers. This factorization expresses each Fuss-Catalan triangle as the product of the d-orthogonal moment array, whose production matrix has A-sequence $(1+x)^r$ and Z-sequence $(1+x)^{r-1}$, with a binomial-type Riordan array. The rectified Fuss-Catalan matrix $(g_r(x),g_r(x))$ is recovered by multiplying the pre-Fuss-Catalan array on the right by the transpose of the binomial matrix, giving the explicit sum formula for its entries. The same banded production matrices tie the construction to constant-coefficient d-orthogonal polynomial recurrences and to lattice paths with step sets $\{(1,1),(2-r,1-r)\}$ and $\{(0,1),(1,1-r)\}$.

Load-bearing premise

The d-orthogonal reading of the Fuss-Catalan arrays rests on an asserted correspondence between constant-coefficient d-th order polynomial recurrences and banded lower-triangular matrices; if that correspondence fails, the polynomial interpretation would need revision, although the entry formula and the factorization would still hold.

Editorial extensions

If this is right

  • Every Fuss-Catalan-Riordan array $(g_r(x),xg_r(x))$ factors canonically as $(g_r(x),xg_r(x)^r)\cdot\left(1,\frac{x}{(1+x)^{r-1}}\right)$, so its entries can be computed from the closed form for $\tau_{n,k}$ together with the binomial-type factor.
  • The Fuss-Catalan matrix, the rectification $(g_r(x),g_r(x))$, is the product of the pre-Fuss-Catalan array with the transpose of the binomial matrix, with general term $\sum_{j=0}^n \frac{rj+1}{(r-1)n+j+1}\binom{rn}{n-j}\binom{k}{j}$.
  • For each $r$, the pre-Fuss-Catalan array has banded production matrix with A-sequence $(1+x)^r$ and Z-sequence $(1+x)^{r-1}$, making it the moment array of a constant-coefficient d-orthogonal polynomial recurrence such as $P_n(x)=(x-r)P_{n-1}(x)-\binom{r}{2}P_{n-2}(x)-\cdots-P_{n-r}(x)$.
  • The arrays carry lattice path counts: $(g_r(x),xg_r(x))$ is the path matrix for the step set $\{(1,1),(2-r,1-r)\}$, and the rectified Fuss-Catalan matrix counts paths for $\{(0,1),(1,1-r)\}$.
  • The general downshift identity shows that for any Riordan array $(g,f)$, multiplying its inverse by the transpose of the binomial matrix and downshifting produces $(g,f)^{-1}\cdot(1,(1+x)f)$, which yields parameterized and generalized Fuss-Catalan-type matrices.

Reading between the lines

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

  • The correspondence in Section 3 between constant-coefficient d-th order recurrences and almost Riordan arrays with banded production matrices is asserted rather than proved for general $d$; filling in that proof would convert the examples into a theorem and would give a direct recipe for the coefficient array from the $(d+1)$-diagonal production matrix.
  • Because the factorization separates the d-orthogonal factor from $\left(1,\frac{x}{(1+x)^{r-1}}\right)$, a natural test is whether replacing $r$ by a non-integer parameter or a formal variable preserves the closed forms; positivity of $\tau_{n,k}$ would then follow from binomial identities rather than lattice path geometry.
  • The paper's insertion of a parameter $s$ into the Fuss-Catalan matrix points to a deformation family; one could ask whether the deformed arrays remain d-orthogonal and whether their Hankel transforms stay as structured as those in the examples.
  • The downshift identity is stated for arbitrary Riordan arrays, so applying it to other banded production matrices should generate new families of integer triangles whose entries admit closed forms of the same type.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 6 minor

Summary. This note studies the Riordan arrays (g_r(x), x g_r(x)^r), where g_r(x) = 1 + x g_r(x)^r. It proves a closed form for their entries (Proposition 13), a factorization of the Fuss-Catalan-Riordan array (g_r(x), x g_r(x)) into that array and the simple Riordan array (1, x/(1+x)^{r-1}) (Proposition 16), and a description of the Fuss-Catalan matrix as a right binomial transform (Proposition 17). The paper also presents production-matrix computations, explicit examples for r = 2, 3, 4, and a discussion of d-orthogonal polynomials and lattice paths.

Significance. If the d-orthogonality claim is fully established, the paper gives a clean and useful package: explicit general formulas, a transparent Lagrange-inversion derivation, and an elegant factorization with production-matrix insight. Proposition 13 and Proposition 16 are elementary and self-contained, with no fitted parameters or circular reasoning; the OEIS links and examples are helpful. The d-orthogonal interpretation is the weakest point: it is asserted for general r rather than proved, and this gap concerns the paper's titular claim.

major comments (2)
  1. [§3 and §4] The correspondence between constant-coefficient d-orthogonal polynomial recurrences and almost Riordan arrays is stated without proof, and the paper does not give a definition of d-orthogonality (in terms of d linear functionals or a Favard-type characterization). In Section 3 the paragraph 'Generalizations for d ≥ 4 follow a similar pattern' asserts the general fact, and Section 4 uses it to conclude that the moment array with production data Z(x)=(1+x)^{r-1}, A(x)=(1+x)^r is (g_r, x g_r^r), but for arbitrary r no polynomial family is exhibited: the recurrences and initial conditions are written only for r = 2, 3, 4. Consequently, the claim in the abstract that the Fuss-Catalan-Riordan arrays are defined 'by means of' a special family of d-orthogonal polynomials is not justified for general r. Please either add a proof (or a precise citation) of the general correspondence, construct the polynomials for all r with explicit initial rows and the (r+1)-term recurrence, or explicitly restrict the d-orthogonal claim to the verified cases.
  2. [§8] The general statement that the Fuss-Catalan-Riordan array is the lattice-path matrix for the step set {(1,1), (2-r, 1-r)} is asserted without proof, and its relation to Proposition 1, which uses the steps (1,1) and (1,1-r), is not explained. Since the paper's title and abstract advertise lattice paths, this deserves a precise statement and a proof for all r, or at least an explicit convention that links the two path models.
minor comments (6)
  1. [§3, first displayed equations] The line 'for the Riordan array (g(x), xgr(x))' with Z(x)=(1-x)^{r+1}, A(x)=(1+x)^r appears to be a typo: Proposition 5 gives Z(x)=(1+x)^{r-1} for the array (g_r(x), x g_r(x)^r), and the symbol g(x) is undefined.
  2. [§2] In the definition of Riordan arrays, the text says 'Because f ∈ F0, Riordan arrays have lower-triangular matrix representatives'; this should read f ∈ F1.
  3. [§3, 2-orthogonal example] In the displayed Riordan array for the 2-orthogonal case, the denominator '1 + ax + bx^2 + cx^2' should almost certainly be '1 + ax + bx^2 + cx^3' to match the second component x/(1+ax+bx^2+cx^3).
  4. [§4, Examples 10 and 11] The initial condition 'P0(1)=1' should be 'P0(x)=1' in both examples.
  5. [§7, fifth displayed matrix] In the fifth matrix displayed for (g_r, x g_r^r), the entries 10 and 20 in rows three and four should apparently be 30 and 200, respectively, to agree with Example 12 and Proposition 13; the displayed matrices also should state clearly that they correspond to r = 0, 1, 2, 3, 4.
  6. [§8] The path-counting variable u(x) is used without a definition, and the step set {(1,1), (-1,-2)} should be reconciled explicitly with the Raney step set {(1,1), (1,1-r)} of Proposition 1.

Circularity Check

1 steps flagged · score 4.0 of 10

Self-definitional d-orthogonal framing; core Riordan-array formulas are independently proved.

  1. self definitional [Section 4, opening paragraph (Special d-orthogonal polynomials)]
    "We now look at the case of d-orthogonal polynomials, whose coefficient array is a Riordan array, where the production array of the inverse of the coefficient array (that is, the moment array) has Z(x) = (1 + x)^{r−1}, A(x) = (1 + x)^r. Thus we are considering the family of Riordan arrays (g_r(x), xg_r(x)^r)."

    The 'special family of d-orthogonal polynomials' is introduced by the condition that the production array of the inverse of its coefficient array has Z=(1+x)^{r-1}, A=(1+x)^r. By the Riordan inverse formula used earlier, this fixes the moment array to be (g_r, x g_r^r), precisely the pre-Fuss-Catalan-Riordan array whose definition is at issue. The coefficient array of the polynomials is then, by definition of 'moment array', the inverse of that same array. Thus, for general r, the d-orthogonal polynomials are not constructed independently and then shown to have the claimed coefficient array; rather, the target array is inserted as the moment array, making the 'definition by means of d-orthogonal polynomials' a renaming of the inverse relation.

full rationale

Proposition 13's entry formula and Proposition 16's factorization are derived directly from the defining equation g_r=1+x g_r^r via Lagrange inversion and the Riordan product rule; no parameter is fitted and no external 'prediction' is used as an input. The reversion identities in Propositions 2-3 and the A/Z-sequence computations in Propositions 4-5 are also proved in-line from that same equation. The only step that has a definitional flavor is the d-orthogonal interpretation in Section 4: the polynomial family is specified by requiring its moment array's production matrix to have Z=(1+x)^{r-1}, A=(1+x)^r, which fixes the moment array to be (g_r, x g_r^r) and makes the coefficient array its inverse by construction. This does not infect the matrix identities themselves, but it means the abstract's claim that the Fuss-Catalan-Riordan arrays are 'defined by means of d-orthogonal polynomials' is, for general r, equivalent to naming the inverse of the chosen moment array as the d-orthogonal coefficient array. The statement in Section 3 that the correspondence generalizes to all d is asserted without proof; that is a support gap for the d-orthogonality reading, not a circularity in the Riordan-array computations. Given that the central explicit formulas and factorizations are self-contained, the circularity score is moderate rather than high.

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

No parameters are fitted to data; the paper's results are derived from the defining functional equation and standard power series methods. The only assumptions are background theorems in Riordan array theory and the sketched correspondence with d-orthogonal polynomials.

assumptions (4)
  • standard math Lagrange inversion formula for [x^m] g_r^s, used in Section 5 to derive Proposition 13.
    Cited to Merlini et al. [12]; a standard theorem in generating function manipulation.
  • domain assumption Riordan array group structure and the A/Z sequence characterization.
    Used throughout; cited to Barry [1] and Shapiro et al. [15,17]. Background for the paper.
  • domain assumption Equivalence between banded production matrices and d-orthogonal polynomial sequences with constant coefficients.
    Stated in Section 3 for d=2,3 and asserted to generalize for d>=4; no proof is given in this note.
  • standard math The functional equation g_r(x) = 1 + x g_r(x)^r defines the Fuss-Catalan generating function.
    Definition; consistent with the classical Fuss-Catalan numbers and the Raney lattice path interpretation.

how reviews work

0 comments
Cite this review

Pith. "Pith review of $d$-orthogonal polynomials, Fuss-Catalan matrices and lattice paths." pith.science (2026). https://pith.science/paper/4AQ4X7SQ

@misc{pith2026250516718,
  author       = {Pith},
  title        = {Pith review of: $d$-orthogonal polynomials, Fuss-Catalan matrices and lattice paths},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/4AQ4X7SQ}},
  note         = {Machine review of arXiv:2505.16718}
}
abstract

In this note, we show how to define certain Riordan arrays, that we call the Fuss-Catalan-Riordan arrays, by means of a special family of $d$-orthogonal polynomials. We relate the Fuss-Catalan Riordan arrays to the Fuss Catalan numbers, and to certain lattice paths. We emphasise the role of the production matrices of the Riordan arrays that we encounter in our study.

Figures

Figures reproduced from arXiv: 2505.16718 by the authors.

Figure 1
Figure 1. The Fuss-Catalan-Riordan array (for r = 3) (t(x), xt(x)) as a path matrix where tn,k = 0 if n < 0 or k < 0 or k > n, and t0,0 = 1. The corresponding Fuss-Catalan matrix for r = 3 corresponds to the recurrence tn,k = tn,k−1 + tn−1,k+2. This counts lattice paths form (0, 0) to (n, k) with step set {(0, 1),(1, −2)}. See [PITH_FULL_IMAGE:figures/full_fig_p022_1.png] view at source ↗
Figure 2
Figure 2. The Fuss-Catalan matrix for r = 3 (t(x), t(x)) as a path matrix for the Fuss-Catalan matrix we can proceed to introduce another parameter Xn j=0 rj + 1 (r − 1)n + j + 1 s n−j  rn n − j k j  . For r = 2, we obtain a generalized Fuss-Catalan matrix that begins   1 1 1 1 s s + 1 s + 2 s + 3 2s 2 2s 2 + 3s 2s 2 + 6s + 1 2s 2 + 9s + 3 5s 2 5s 3 + 9s 2 5s 3 + 18s 2 + 5s 5s 3 + 27s 2 + 15s + 1   . This is the r… view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

20 extracted references · 14 canonical work pages

  1. [1]

    Barry, Riordan Arrays: a Primer , Logic Press, 2017

    P. Barry, Riordan Arrays: a Primer , Logic Press, 2017

    2017

  2. [2]

    Barry, On the group of almost-Riordan arrays, https://arxiv.org/abs/1606.05077

    P. Barry, On the group of almost-Riordan arrays, https://arxiv.org/abs/1606.05077

    arXiv

  3. [3]

    Generalized Path Pairs and Fuss-Catalan Triangles

    P. Drube, Generalized path pairs & Fuss-Catalan triangles, https://arxiv.org/pdf/2007.01892

    work page Pith review arXiv 2007

  4. [4]

    Ehrenborg, G

    R. Ehrenborg, G. Heytei, and M. Readdy, Catalan-Spitzer permutations, Enumer. Com- bin. Appl. , 4 (2024) 4:2 (2024) Article #S2R15

    work page 2024

  5. [5]

    R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics: a foundation for computer science , Addison-Wesley, 1989

    work page 1989

  6. [6]

    Sprugnoli, Sequence characterization of Riordan arrays, Discrete Maths., 309 (2009), 3962—3974

    Tian-Xiao He, R. Sprugnoli, Sequence characterization of Riordan arrays, Discrete Maths., 309 (2009), 3962—3974

    work page 2009

  7. [7]

    , 465 (2015), 15–42

    Tian-Xiao He, Matrix characterizations of Riordan arrays, Linear Algebra Appl. , 465 (2015), 15–42

    2015

  8. [8]

    Tian-Xiao He, Riordan array approach to Lagrange inversion formulas and Chung-Feller theory, Advances in Applied Mathematics 144, (2023), 102454

    work page 2023

Show all 20 references
  1. [9]

    J. W. Layman, The Hankel transform and some of its properties, J. Integer Seq. , 4 (2001), Article 01.1.5

    2001

  2. [10]

    Merlini, D

    D. Merlini, D. G. Rogers, R. Sprugnoli, M. C. Verri, On Some Alternative Characteri- zations of Riordan Arrays, Canad. J. Math. , 49 (1997), 301–320. 28

    1997

  3. [11]

    Merlini, R

    D. Merlini, R. Sprugnoli, and M. C. Verri, The method of coefficients, Amer. Math. Monthly, 114 (2007), 40–57

    2007

  4. [12]

    Merlini, R

    D. Merlini, R. Sprugnoli, and M. C. Verri, Lagrange inversion: when and how, Acta Appl. Math. , 94 (2006), 233–249

    2006

  5. [13]

    Cerone, A Unified Generalization of the Catalan, Fuss, and Fuss-Catalan Numbers, Math

    Feng Qi, Xiao-Ting Shi, and P. Cerone, A Unified Generalization of the Catalan, Fuss, and Fuss-Catalan Numbers, Math. Comput. Appl. , 24 (2019) 49

    2019

  6. [14]

    D. G. Rogers, Pascal triangles, Catalan numbers and renewal arrays, Discrete Math. , 22 (1978), 301–310

    1978

  7. [15]

    Shapiro, R

    L. Shapiro, R. Sprugnoli, P. Barry, G.-S. Cheon, T.-X. He, D. Merlini, and W. Wang, The Riordan Group and Applications , Springer, 2022

    2022

  8. [16]

    Shapiro, A survey of the Riordan group, available electronically at Center for Com- binatorics, Nankai University, 2018

    L. Shapiro, A survey of the Riordan group, available electronically at Center for Com- binatorics, Nankai University, 2018

    2018

  9. [17]

    L. W. Shapiro, S. Getu, W-J. Woan, and L.C. Woodson, The Riordan group, Discr. Appl. Math. , 34 (1991), 229–239

    1991

  10. [18]

    N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences . Published electroni- cally at http://oeis.org, 2021

    2021

  11. [19]

    N. J. A. Sloane, The On-Line Encyclopedia of Integer Sequences, Notices Amer. Math. Soc., 50 (2003), 912–915

    2003

  12. [20]

    Yang, Y-N

    S-L. Yang, Y-N. Dong, T-X. He, and Y-X. Xu, A unified approach for the Catalan matrices by using Riordan arrays, Lin. Algebra Appl. , 558 (2018), 25–43. 2010 Mathematics Subject Classification : Primary 05A15; Secondary 15B36, 11B37, 11B83, 11C20, 42C05, 11Y55 Keywords: Catala...

    2018

Pith tools

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