Pith. sign in

REVIEW 2 major objections 4 minor 2 cited by

Combinatorics of generalized orthogonal polynomials of type $R_{II}$

T0 review · 2 major / 4 minor · reviewed 2026-08-12 · deepseek-v4-flash

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

Pith's one-line read The paper establishes that for generalized $R_{II}$ orthogonal polynomials admitting a good basis, generalized moments are weighted sums of RII lattice paths, and dual coefficients are weighted sums of restricted RII paths.

desk verdict Solid master theorem and a genuinely new R_II path model, but Theorem 5.1's sign-reversing involution has a concrete missing case that should be fixed before the paper is accepted. read the letter →

arxiv 2411.12345 v1 pith:B7ISNXGC submitted 2024-11-19 math.CO math.CA

Jang Soo Kim , Minho Song This is my paper · ORCID
classification math.COmath.CA MSC 05A1533C4542C0505A19
keywords R_IIorthogonalpolynomialsgeneralizedmomentsdualcoefficientsRIIpathsrestrictedgoodbasislatticepathcombinatoricscontinuedfractions
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 develops a combinatorial model for generalized orthogonal polynomials of type $R_{II}$, the sequences $P_n(x)$ defined by $P_{n+1}(x)=(x-b_n)P_n(x)-(c_nx^2+a_nx+\lambda_n)P_{n-1}(x)$ with only the mild condition that each coefficient triple not be all zero. Its master theorem asserts that if the vector space $W=\operatorname{span}\{x^n Q_m(x): n,m\ge0\}$ has a good basis, then there is a linear functional $L$ on $W$ for which $L(x^n P_r(x)Q_s(x))$ equals the weighted sum of all RII paths from $(0,r)$ to $(n,s)$. The four classical families—ordinary orthogonal polynomials, Laurent biorthogonal polynomials, and types $R_I$ and $R_{II}$—are shown to have good bases, so this one theorem recovers the known Motzkin, Schr\"oder, and Motzkin–Schr\"oder path models. A second theorem shows that the dual coefficients $\tau_{n,r,s}$ are the weighted sums of restricted RII paths, which explains why these coefficients are formal power series with nonnegative integer coefficients despite the non-monicity of $P_n^{II}(x)$.

What carries the argument

The RII path is a lattice path from $(0,r)$ to $(n,s)$ using steps $U=(1,1)$, $H=(1,0)$, $D=(1,-1)$, $V=(0,-1)$, $B=(-1,-1)$; its weight is the product of step weights $1,b_i,\lambda_i,a_i,c_i$ according to the starting height. The master theorem's load-bearing condition is a good basis: a basis of $W$ of the form $\{x^nQ_m(x):(n,m)\in S\}$ from which every $x^nQ_m(x)$ can be reached by repeatedly applying the identity $c_{k+1}x^{\ell+2}Q_{k+1}+a_{k+1}x^{\ell+1}Q_{k+1}+\lambda_{k+1}x^{\ell}Q_{k+1}=x^{\ell+1}Q_k-b_kx^\ell Q_k-x^\ell Q_{k-1}$. This identity is the exact analogue of the decomposition of an RII path by its last step, which is what lets the weight sum satisfy the same linear recurrences as the functional values. For dual coefficients, the auxiliary machinery is a dotted tiling—a tiling of a $1\times n$ board by monominoes and dominoes decorated with dots—paired with a restricted RII path; a sign-reversing involution on these pairs isolates the terms of $x^nP_r(x)$.

What would settle it

Compute the series expansion of $\tau_{3,0,1}$ both by directly solving $x^3=\sum_s\tau_{3,0,s}P_s(x)$ and by summing weights of restricted RII paths in $\widetilde R_{3,0,1}$; Theorem 5.1 predicts the two are equal in the ring of formal power series. Any disagreement, or any negative coefficient in the restricted-path sum, would refute the dual-coefficient formula.

Watch

Extended reading notes

Core claim

On its own terms, the central claim is that one combinatorial object—the RII path, with up, horizontal, down, vertical-down, and backward-down steps weighted respectively by $1$, $b_i$, $\lambda_i$, $a_i$, $c_i$—carries both the generalized moments and the dual coefficients of generalized $R_{II}$ polynomials. Theorem 4.3 states that whenever $W$ has a good basis, a linear functional $L$ exists with $L(x^nP_rQ_s)=\sum_{p\in R_{n,r,s}}\operatorname{wt}(p)$, and Theorem 5.1 states that the coefficients $\tau_{n,r,s}$ in $x^nP_r(x)=\sum_s\tau_{n,r,s}P_s(x)$ equal $\sum_{p\in\widetilde R_{n,r,s}}\operatorname{wt}(p)$ for restricted RII paths. The proof of Theorem 4.3 runs by showing that the recurrence (4.1)/(4.2) for the $Q_m$ is exactly the last-step decomposition of RII paths, so any good basis allows the path-weight identity to propagate from basis elements to all of $W$. Theorem 5.1 is proved by a sign-reversing involution on pairs of restricted paths and dotted tilings that leaves as fixed points the terms contributing to $x^nP_r(x)$.

Load-bearing premise

Everything in the master theorem rests on the existence of a good basis for $W$; the paper verifies this for the four classical families but leaves the general characterization as an open problem, so a recurrence without a good basis is not covered.

Editorial extensions

If this is right

  • The generalized moments of classical, Laurent biorthogonal, $R_I$, and $R_{II}$ orthogonal polynomials all become the generating function of the same kind of lattice path, with only the allowed step set changing.
  • The dual coefficients $\tau_{n,r,s}$ of $R_{II}$ polynomials have nonnegative integer coefficients as formal power series in $b,\lambda,a,c$; the paper proves this by giving them a restricted-path interpretation.
  • When the recurrence coefficients are bounded and $|c_m|<1/4-\epsilon$, the generalized moments converge absolutely; for dual coefficients the convergence needs only the bound on $c_m$.
  • In the constant-coefficient case the moment generating function satisfies $\mu(x)=1+bx\mu(x)+(c+ax+\lambda x^2)\mu(x)^2$, and $\mu_n$ equals $C$ times the moment of suitably chosen classical or $R_I$ orthogonal polynomials, giving closed formulas for Hankel determinants.
  • The good-basis list includes sequences not covered by any of the four classical families, for example $c_{2n+1}=0$ and $c_{2n}\neq0$, so the theorem genuinely extends beyond existing path models.

Reading between the lines

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

  • The good-basis condition is likely equivalent to a structural property of the index set $S$, such as closure under the last-step reduction; if characterized, Theorem 4.3 would become a fully algorithmic way to build the linear functional for any RII recurrence.
  • The restricted-path formula for $\tau_{n,r,s}$ suggests that for $R_I$ and $R_{II}$ families there should be a bijective, not merely analytic, proof that $x^nP_r=\sum_s(\text{restricted path sum})P_s$, possibly with $q$-analogues obtained by grading steps by crossings.
  • One could test whether the constant-coefficient identity $\mu_n=C\cdot\mu_n(B,\Lambda)$ persists for generalized moments $\mu_{n,r,s}$ with a height-dependent scaling factor; the paper's own counterexamples for simple rescaling show such an extension would require genuinely new weights.
  • The absolute convergence criterion $|c_m|<1/4-\epsilon$ is likely sharp in the sense that at $|c|=1/4$ the Catalan-like generating function develops a square-root singularity, so moments may still converge but only conditionally.
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 / 4 minor

Summary. The paper develops a combinatorial theory for orthogonal polynomials of type R_II and their generalizations. After defining the extended space W = span{x^n Q_m(x) : n,m ≥ 0}, it proves a basis theorem for W, constructs a linear functional whose values are weighted sums over R_II paths, and obtains path-sum formulas for generalized moments. A master theorem is proved under a 'good basis' hypothesis, covering classical, Laurent, type R_I, and type R_II polynomials as special cases. The paper then gives a restricted-path interpretation of dual coefficients, proves convergence of the relevant path sums under mild boundedness assumptions, and, in the constant-coefficient case, expresses the moments as those of classical or type R_I orthogonal polynomials.

Significance. The paper's main contribution is a new combinatorial model for R_II orthogonal polynomials: the path-sum formulas are derived from the recurrence relations rather than assumed, and the basis theorem is proved in detail. This gives a unified framework that extends Flajolet–Viennot moment theory to a setting where the polynomials are non-monic and the moment functional is defined on a larger space. The dual-coefficient interpretation, if fully established, is a substantial new result. The master theorem is honest about its hypothesis, and the convergence and constant-coefficient sections provide useful context. However, the proof of the dual-coefficient theorem is incomplete as written, so the paper needs a revision before the main claims are fully supported.

major comments (2)
  1. [§5, Theorem 5.1] The proposed sign-reversing involution φ is not defined on all of the set X. In Case 2 (i > j), the construction uses the step p_{i+1}; if the path consists entirely of up steps, that step does not exist. For example, take n=2, r=0, p=UU in ~R_{2,0,2}, and T=M0M1 in DT_2; then i=2, j=1, so the pair falls in Case 2, but p_3 is undefined. Similarly, in Case 1-1, the map inserts a tile after T^{i+1}; when i=j equals the number of tiles of T, that tile does not exist, as in p=HU in ~R_{2,0,1} with T=M1. Thus φ is not an involution on X, and the proof of (5.4) is incomplete. Since this is the central argument establishing the dual-coefficient formula, the theorem is not yet proved; a repair would require treating these boundary cases explicitly.
  2. [§4, Theorem 4.3 and Problem 4.5] The master theorem is conditional on the existence of a good basis in the sense of Definition 4.2, and the general characterization of such bases is left open. Consequently, for an arbitrary sequence satisfying Definition 4.1, the path-sum formula for generalized moments is not established by the theorem. The conditional statement itself is clear and the table of examples is useful, but the abstract and introduction should not suggest that the master theorem covers all generalized R_II polynomials without this hypothesis.
minor comments (4)
  1. [§2, Preliminaries] In the sentence defining Motzkin, Schröder, and Motzkin–Schröder paths, the starting point is written '(r,0)' instead of '(0,r)'; this is inconsistent with the notation immediately preceding it.
  2. [§5, Case 2 of the proof of Theorem 5.1] The sentence 'the starting height k-i of the step p_i is at least 1 because k-i > k-j ≥ 0' contains a false inequality; since i>j, one has k-i < k-j. The intended claim needs to be restated.
  3. [§3, proof of Theorem 3.9] In equation (3.7), for k=0 terms such as µ_{n+2,−1,s} appear; the convention that P_{−1}=Q_{−1}=0 and that such terms vanish should be stated explicitly.
  4. [References] References [1], [9], and [13] do not appear to be cited in the body of the paper; please check and either cite them or remove them.

Circularity Check

0 steps flagged · score 1.0 of 10

No significant circularity: generalized moments and dual coefficients are proved from recurrences via a constructed functional and a sign-reversing involution; the Kim–Stanton citation is motivational only.

full rationale

The paper's central claims do not reduce to their inputs. In Theorem 4.3, L is defined on a good basis B by L(x^n Q_m) = R_{n,m} (Eq. 4.3), where R_{n,m} is the independent RII-path generating function; the proof then uses recurrence (4.2) and the path recurrence (4.5) to propagate this equality to all basis elements, with the r >= 0 case following by induction on r. This is a constructive derivation, not a fitted prediction. Proposition 3.7 and Theorem 3.9 have the same structure. Theorem 5.1 defines tau'_{n,r,s} as the restricted-RII-path sum and proves it equals tau_{n,r,s} by verifying the defining expansion (5.4) through the tiling identity (5.5) and a sign-reversing involution; the target equality is not assumed. The only flagged proof issue is a correctness gap, not circularity: in the proof of Theorem 5.1, Cases 2-1 and 2-2 refer to p_{i+1} when i > j, but p_{i+1} is undefined when the path consists entirely of U steps, e.g. n = 2, r = 0, p = UU, T = M0M1; similarly Case 1-1 can refer to T^{i+1} when the tiling has no tile after the trailing M1-run. This makes the involution proof incomplete but does not make the statement an input. The citation to Kim–Stanton [10] is a self-citation for one author, but it is used as motivation and as an instance that the master theorem unifies, not as load-bearing justification. No fitted parameter is renamed as a prediction, and no known result is merely relabeled. Problem 4.5 is an explicit limitation on the good-basis hypothesis, not a circular recycling of the conclusion. Accordingly the circularity score is minimal.

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

No free parameters are fitted and no physical or structural entities are postulated. The RII path and dotted tiling are definitional combinatorial tools whose consistency is proved within the paper.

assumptions (3)
  • standard math Formal power series in the variables b_i, lambda_i, a_i, and c_i are well-defined and can be summed over the infinite family of RII paths.
    Used to define L(x^n) and path weight sums in Definition 3.5 and Proposition 3.7. Section 6 supplies analytic convergence conditions when needed.
  • domain assumption For a sequence of ordinary type R_II, the nonvanishing conditions c_n nonzero, P_n(alpha_n) nonzero, and P_n(beta_n) nonzero hold for all n at least 1.
    Required by Definition 2.1 and by the basis proof of Theorem 3.1, especially Lemma 3.3.
  • ad hoc to paper The vector space W admits a good basis in the sense of Definition 4.2 for the sequences under consideration.
    Theorem 4.3 is conditional on this hypothesis; the paper proves it for the four classical subclasses but leaves the general characterization open in Problem 4.5.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Combinatorics of generalized orthogonal polynomials of type $R_{II}$." pith.science (2026). https://pith.science/paper/B7ISNXGC

@misc{pith2026241112345,
  author       = {Pith},
  title        = {Pith review of: Combinatorics of generalized orthogonal polynomials of type $R_II$},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/B7ISNXGC}},
  note         = {Machine review of arXiv:2411.12345}
}
abstract

In 1995, Ismail and Masson introduced orthogonal polynomials of types \( R_I \) and \( R_{II} \), which are defined by specific three-term recurrence relations with additional conditions. Recently, Kim and Stanton found a combinatorial interpretation for the moments of orthogonal polynomials of type \( R_I \) in the spirit of the combinatorial theory of orthogonal polynomials due to Flajolet and Viennot. In this paper, we push this combinatorial model further to orthogonal polynomials of type \( R_{II} \). Moreover, we generalize orthogonal polynomials of type \( R_{II} \) by relaxing some of their conditions. We then prove a master theorem, which generalizes combinatorial models for moments of various types of orthogonal polynomials: classical orthogonal polynomials, Laurent biorthogonal polynomials, and orthogonal polynomials of types \( R_I \) and \( R_{II} \).

Figures

Figures reproduced from arXiv: 2411.12345 by the authors.

Figure 1
Figure 1. An RII path P = UUBUBUV UUV BDHU ∈ R6,1 with wt(P) = a2a3b0c 3 2λ1. The thick segment from (1, 1) to (2, 2) represents UBUBU. Here, we use the standard convention that the empty product is defined to be 1; for example, d0(x) = 1. We also define the vector space (2.2) W = span{x nQm(x) : n, m ≥ 0}. Ismail and Masson [5] showed that orthogonal polynomials of type RII have partial orthogo￾nality as follows. Theorem 2.2… view at source ↗
Figure 2
Figure 2. An example of T ∈ DT8 with wt(T ) = a2b3c5λ7. We will prove (5.4) by giving combinatorial interpretations for both sides and finding a sign￾reversing involution. To do this we introduce the following definition. Definition 5.2. Consider a 1 × n square board whose boxes are labeled 1 through n from left to right. Let Mi (resp. Di) be a monomino (resp. domino) with i dots inside. A dotted tiling of size n is a tiling … view at source ↗
Figure 3
Figure 3. An example of (P, T ) ∈ Re5,2,5 × DT5 for Case 1-1 and its image (φ(P), φ(T )) ∈ Re5,2,6 × DT6 corresponding to Case 2-1, described in the proof of Theorem 5.1. (0, 2) (5, 4) i = 2 1 2 3 4 j = 4 (1-2) (2-2) (0, 2) (5, 6) i = 3 1 2 3 4 5 6 j = 2 [PITH_FULL_IMAGE:figures/full_fig_p012_3.png] view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: An example of (P, T ) ∈ Re5,2,4 × DT4 for Case 1-2 and its image (φ(P), φ(T )) ∈ Re5,2,6 × DT6 corresponding to Case 2-2, described in the proof of Theorem 5.1. Case 1-5: p i+1 does not exist. In this case, let (p ′ , T ′ ) = (p, T ). Case 2: i > j. In this case, the s…
Figure 5
Figure 5. Figure 5: An example of (P, T ) ∈ Re5,2,4 × DT4 for Case 1-3 and its image (φ(P), φ(T )) ∈ Re5,2,5 × DT5 corresponding to Case 2-3, described in the proof of Theorem 5.1. (0, 2) (5, 4) i = 2 1 2 3 4 j = 2 (1-4) (2-4) (0, 2) (5, 4) i = 1 1 2 3 4 j = 0 [PITH_FULL_IMAGE:figures/fu…
Figure 6
Figure 6. Figure 6: An example of (P, T ) ∈ Re5,2,4 × DT4 for Case 1-4 and its image (φ(P), φ(T )) ∈ Re5,2,4 × DT4 corresponding to Case 2-4, described in the proof of Theorem 5.1. Corollary 5.3. Let (P I n (x))n≥0 be the sequence of orthogonal polynomials of type RI defined in (1.3) and …
Figure 7
Figure 7. Figure 7: A visualization of the functional equation for µ(x). For the convergence of τn,r,s, we only need the condition on c. Corollary 6.4. Suppose that |cm| < 1 4 − ǫ for all m, where ǫ > 0 is a fixed number. Then the dual coefficients τn,r,s converge absolutely. Proof. Recal…

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Three-term Recurrence Relation with Arbitrary Degree Steps for Orthogonal Polynomials

    math.NA 2026-06 unverdicted novelty 5.0 of 10

    Any orthogonal polynomial family defined by Favard's theorem satisfies Q_{p+s}(x)=M(x)Q_p(x)+N(x)Q_{p-t}(x), with coefficients built from the standard recurrence coefficients.

  2. A Vision-Language Framework for Multispectral Scene Representation Using Language-Grounded Features

    cs.CV 2025-01 conditional novelty 5.0 of 10

    A lightweight projection layer trained to align frozen SpectralGPT multispectral features with LLaMA-3 text embeddings markedly improves EuroSAT classification and enables multispectral scene description.

Reference graph

Works this paper leans on

13 extracted references · 13 canonical work pages · cited by 2 Pith papers

  1. [1]

    Bousquet-M´ elou and M

    M. Bousquet-M´ elou and M. Mishna. W alks with small steps in the quarter plane. In Algorithmic probability and combinatorics , volume 520 of Contemp. Math. , pages 1–39. Amer. Math. Soc., Providence, RI, 2010

    work page 2010

  2. [2]

    Lecture hall graphs and the Askey scheme

    S. Corteel, B. Jonnadula, J. P. Keating, and J. S. Kim. Lec ture hall graphs and the Askey scheme. Preprint, arXiv:2311.12761, 2023

    work page Pith review arXiv 2023

  3. [3]

    Corteel and J

    S. Corteel and J. S. Kim. Lecture hall tableaux. Adv. Math. , 371:107266, 35, 2020

    work page 2020

  4. [4]

    Flajolet

    P. Flajolet. Combinatorial aspects of continued fracti ons. Discrete Math. , 32(2):125–161, 1980

    work page 1980

  5. [5]

    M. E. H. Ismail and D. R. Masson. Generalized orthogonali ty and continued fractions. J. Approx. Theory , 83(1):1–40, 1995

    work page 1995

  6. [6]

    M. E. H. Ismail and A. Sri Ranga. RII type recurrence, generalized eigenvalue problem and ortho gonal poly- nomials on the unit circle. Linear Algebra Appl. , 562:63–90, 2019

    work page 2019

  7. [7]

    Combinatorics of orthogonal polynomials on the unit circle

    J. Jang and M. Song. Combinatorics of orthogonal polynom ials on the unit circle. Preprint, arXiv:2407.07508, 2024

    work page Pith review arXiv 2024

  8. [8]

    S. Kamioka. A combinatorial representation with Schr¨ o der paths of biorthogonality of Laurent biorthogonal polynomials. Electron. J. Combin. , 14(1):Research Paper 37, 22, 2007

    work page 2007

Show all 13 references
  1. [9]

    S. Kamioka. A combinatorial derivation with Schr¨ oder p aths of a determinant representation of Laurent biorthogonal polynomials. Electron. J. Combin. , 15(1):Research Paper 76, 20, 2008

    2008

  2. [10]

    J. S. Kim and D. Stanton. Combinatorics of orthogonal po lynomials of type RI . Ramanujan J., 61(2):329–390, 2023

    2023

  3. [11]

    Shukla and A

    V. Shukla and A. Swaminathan. Chain sequences and zeros of polynomials related to a perturbed RII type recurrence relation. J. Comput. Appl. Math. , 422:Paper No. 114916, 24, 2023

    2023

  4. [12]

    G. Viennot. Une th´ eorie combinatoire des polynˆ omes orthogonaux g´ en´ eraux. Lecture Notes, UQAM, 1983

    1983

  5. [13]

    Zhedanov

    A. Zhedanov. Biorthogonal rational functions and the g eneralized eigenvalue problem. J. Approx. Theory , 101(2):303–329, 1999. Department of Mathematics, Sungkyunkw an University, Suwon , South Korea Email address : jangsookim@skku.edu Department of Mathematics, Sungkyunkw an...

    1999

Pith tools

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