Pith. sign in

REVIEW 3 major objections 3 minor 36 references

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

T0 review · 3 major / 3 minor · reviewed 2026-08-02 · deepseek-v4-flash

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

Pith's one-line read The paper's central claim: any orthogonal polynomial sequence generated by Favard's theorem satisfies a three-term recurrence with arbitrary degree step, so any member can be computed directly from two non-adjacent members through explicit

desk verdict A correct and useful transfer-matrix recipe for arbitrary-step three-term recurrences, but the universal claim needs a nondegeneracy qualifier and a few slips before it is a reliable reference. read the letter →

arxiv 2606.13056 v2 pith:TKB2PMQP submitted 2026-06-11 math.NA cs.NA

Bo Yang This is my paper · ORCID
classification math.NAcs.NA MSC 33C4542C0565D20
keywords Favard'stheoremorthogonalpolynomialsthree-termrecurrencearbitrarydegreestepdegree-skipHermiteGegenbauerLegendre
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

For orthogonal polynomial families generated by Favard's recurrence, the paper derives a three-term recurrence relation with arbitrary degree step: Q_{p+s}(x) = M(x)Q_p(x) + N(x)Q_{p-t}(x). The upshot is that any member of such a family can be computed directly from any two members, skipping intermediate degrees. The coefficients M and N are explicit rational expressions in the Favard coefficients, and eliminating Q_{p-1} is the key step. The paper also gives decreasing-degree and end-to-middle versions, and explicit two-step recurrences for Hermite, Gegenbauer, and Legendre polynomials, with numerical comparisons showing accuracy close to the standard one-step recurrences. A reader should care because this turns a sequential recurrence into a jump recurrence, a structural fact about every Favard-defined orthogonal family.

What carries the argument

The central object is the transfer-matrix product W generated by the Favard step, whose entries are the bridge coefficients Ψ_{p+s}^{(p)}, Ψ_{p+s}^{(p-1)}, ψ_{p-t}^{(p)}, ψ_{p-t}^{(p-1)} satisfying (26) and (47). The argument pivots on forming the 2×2 matrix K from these four coefficients; since each transfer factor has determinant C_p≠0, K has nonzero determinant precisely when the two bridge relations are independent. Dividing the two representations of Q_{p+s} and Q_{p-t} by their Q_{p-1} coefficients makes Q_{p-1} cancel, yielding M=det(K)/ψ_{p-t}^{(p-1)}, N=Ψ_{p+s}^{(p-1)}/ψ_{p-t}^{(p-1)}. So K and its determinant carry the entire reduction: the existence of the skip-step relation is a

What would settle it

For Legendre polynomials at x=0, take p=5, s=3, t=2: L8(0)=35/128≠0 while L5(0)=L3(0)=0; any relation Q8=M Q5+N Q3 would give 0, so no rigid three-term relation of the asserted form can hold there. This is a concrete case where the unqualified statement fails.

Watch

Extended reading notes

Core claim

The central discovery is Theorem 4: whenever {Q_p} obeys Favard's recurrence Q_{p+1}=(A_p x+B_p)Q_p - C_p Q_{p-1}, then for any s≥1 and 1≤t≤p the identity Q_{p+s}(x)=M(x)Q_p(x)+N(x)Q_{p-t}(x) holds, with M and N given by ratios and a determinant built from the two coefficient sequences that express Q_{p+s} and Q_{p-t} in terms of the adjacent pair Q_p,Q_{p-1}. The determinant condition encodes that the two bridge relations are independent, so Q_{p-1} can be eliminated. The paper's intended scope is universal: every orthogonal polynomial sequence by Favard's theorem, not only classical families, has such skip-step relations. It makes the construction explicit for Hermite, Gegenbauer and Legen

Load-bearing premise

The clean three-term formula is obtained by dividing by two coefficient functions; if either is zero at the evaluation point, the formula is not derived, and the paper's patches restore only a non-rigid relation with a bias term.

Editorial extensions

If this is right

  • The standard one-step recurrence is the special case (s,t)=(1,1); the new relation therefore generalizes the classical three-term recurrence without leaving the Favard class.
  • Any Favard-defined orthogonal polynomial, classical or not, can be evaluated in arbitrary jumps, so high-degree values can be assembled from two widely separated known members rather than by iterating every degree.
  • The degree-decrease and end-to-middle formulas allow reconstruction of lower or intermediate members from two outer ones, which is useful for inverse evaluations or for moment and quadrature problems.
  • The explicit two-step Hermite, Gegenbauer and Legendre recurrences give directly usable formulas for blockwise evaluation; the numerical experiments show relative errors near the standard recurrences, down to roughly 10^{-10}–10^{-12} percent in the tested ranges.
  • If the clean formula holds at a point, it gives a rational expression for the skipped value in terms of the two known values, so the evaluation cost per target is O(1) once the coefficients are precomputed.

Reading between the lines

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

  • Beyond the paper, the bridge coefficients are products of Favard transfer matrices, so the determinant and denominator conditions are a rank condition: a rigid jump relation exists at x exactly when the two known members are not simultaneously zero there.
  • Beyond the paper, parity of symmetric orthogonal families forces such simultaneous zeros at symmetric points, so the paper's non-rigid bias cases are inevitable whenever s and t have different parity.
  • Beyond the paper, one can test the same construction on Laguerre, Jacobi, or exceptional orthogonal families and check whether the denominators' zeros match common zeros of the bridge polynomials.
  • Beyond the paper, since products of transfer matrices appear, the jump recurrences are equivalent to exponentiating the Favard transfer matrix, suggesting matrix-power algorithms for high-degree evaluation.
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

3 major / 3 minor

Summary. The paper proposes a generalization of the classical three-term recurrence relation for orthogonal polynomial sequences defined by Favard's theorem. For any Favard-defined family {Q_p}, the author derives expressions for Q_{p+s} and Q_{p-t} in terms of adjacent members Q_p, Q_{p-1}, then eliminates Q_{p-1} to obtain a three-term recurrence involving Q_{p+s}, Q_p, Q_{p-t} with coefficient functions M(x), N(x). The paper also treats degree-decrease and end-to-middle directions, gives explicit two-degree-step recurrences for Hermite, Gegenbauer, and Legendre polynomials, and reports numerical precision comparisons against the standard recurrences.

Significance. If the main theorem is stated with the correct qualifications, the paper provides a useful algebraic technique for generating degree-skipping recurrences with explicit rational coefficients for any Favard-defined family. The explicit recurrences for s=t=2 in Section 5 are concrete and checkable, and the numerical experiments support the practical viability of the proposed formulas. However, the central claim as stated in Theorem 4 and the abstract is overreaching: the rigid three-term form does not hold at points where the elimination denominators vanish and Q_p, Q_{p-t} both vanish while Q_{p+s} does not. The paper itself acknowledges this in Remark 3 of Section 4.3 and attempts to patch it in Section 3.4 using bias terms and auxiliary inputs, which are not part of the stated theorem. The algebraic core is sound on the dense set where the coefficients are defined, but the universal formulation must be corrected.

major comments (3)
  1. [Theorem 4, Eqs. (55)-(56); §3.4; §4.3 third remark] Theorem 4 claims that every Favard-defined family satisfies Q_{p+s}=M(x)Q_p(x)+N(x)Q_{p-t}(x) for all 1≤t≤p, s≥1, with no exclusions. The derivation via (54) requires Ψ^{(p-1)}_{p+s}(x)≠0 and ψ^{(p-1)}_{p-t}(x)≠0. When ψ^{(p-1)}_{p-t}(x)=0 and Q_p(x)=Q_{p-t}(x)=0 but Q_{p+s}(x)≠0, no finite M,N satisfying (55) can exist. The paper's own §3.4, specifically (66)-(67), replaces the three-term relation with a bias expansion Q_{p+s}=l1 Q_p + l2 Q_{p-t} + b(x) with arbitrary l1,l2, which is not a three-term recurrence. The third remark in §4.3 explicitly gives the Legendre example p=5,s=3,t=2,x=0, where L3(0)=L5(0)=0 and L8(0)≠0, and states that no rigid three-term relation exists. Thus Theorem 4 is literally false as stated. The theorem must be restricted to points where the denominators are nonzero, or reformulated as a rational-function identity with exceptional cases handled separately.
  2. [Eq. (46)] The coefficient recursion in Theorem 3 contains an index error. The first entry of the second row is printed as ψ^{(p)}_{p-t-1}(x), but the correct entry is ψ^{(p)}_{p-t+1}(x). Specializing the printed formula to t=3 gives ψ^{(p)}_{p-3}(x)=ψ^{(p)}_{p-4}(x) T_{p-2}(x), which contradicts the directly derived expression (42), ψ^{(p)}_{p-3}(x)=-D_{p-1}(x)T_{p-2}(x). Since (46) is the general recipe for computing coefficients for arbitrary t, this must be corrected.
  3. [§3.4, Eqs. (61)-(67); abstract] In the special case ψ^{(p-1)}_{p-t}(x)=0, the proposed resolution computes Q_{p-1}(x) using Q_0(x) or Q_1(x) as extra inputs (61)/(63), and in the subcase Q_{p-t}(x)=0 it introduces a bias term with arbitrary coefficients (67). Consequently, the recurrence no longer computes Q_{p+s} strictly from Q_p and Q_{p-t}, contrary to the claim in the abstract and Section 1.2 that 'any two members in the sequence' suffice for computing the other member. The theorem and abstract need to state these exceptional cases explicitly as limitations.
minor comments (3)
  1. [Lemma 2 proof] The proof of Lemma 2 refers to 'contradicts (30)' in two places; the reference should be to (50), the determinant of the matrix V for the degree-decrease case.
  2. [§5.2] The initial conditions for Gegenbauer polynomials contain a notational inconsistency: 'Gλ1(x)' should be G^{(λ)}_1(x), matching the notation used elsewhere.
  3. [References] Reference [14] has a typo: 'A introduction to orthogonal polynomials' should be 'An introduction to orthogonal polynomials'.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the recurrence is derived algebraically from Favard's recurrence, with no fitted parameters or load-bearing self-citation.

full rationale

The paper's core claim is an algebraic consequence of the assumed Favard recurrence (3). Equations (26) and (47) are obtained by iterating (3)/(16), with coefficients recursively defined in (25) and (46). The generalized three-term relation (55) is then derived by eliminating Q_{p-1} from two valid identities, and the coefficients M,N in (56) are explicit rational functions of the given Favard coefficients A_i,B_i,C_i. No quantity is fitted to data and then reported as a prediction; the numerical sections compare the proposed recurrences against the standard recurrences (9), (12), (15) as an external benchmark. The only self-citation, [36], concerns the Hermite two-step result and is explicitly described as prior independent work that inspired the generalization, not as a premise of the derivation; the Hermite relation (102) is rederived here from (96)-(101). The zero-denominator and zero-value cases in Section 3.4 weaken the universality of Theorem 4 and are a correctness concern, not a circularity: introducing a bias term b(x) in (67)-(68) is an explicit admission that the rigid three-term form can fail, rather than a disguised reuse of the theorem's conclusion. No step in the derivation chain reduces to its own input, so the circularity score is 0.

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

The paper introduces no new physical or mathematical entities and no fitted constants. It relies entirely on Favard's theorem and the standard recurrence coefficients. The only ad-hoc elements are the arbitrary bias coefficients introduced in degenerate cases, but these do not affect the main theorem.

assumptions (3)
  • standard math Favard's theorem: sequences {Q_p} are defined by Q_{p+1}=(A_p x+B_p)Q_p-C_p Q_{p-1} with A_p≠0, C_p≠0, and C_p A_p A_{p-1}>0.
    Section 2.1 states this as the foundation; all subsequent recurrences are built on this three-term form.
  • domain assumption The Favard coefficients A_p, B_p, C_p for the target polynomial family are known.
    Sections 5 and 6 use the known coefficients for Hermite, Gegenbauer, and Legendre polynomials; the practical usefulness of the method depends on this knowledge.
  • ad hoc to paper The denominator coefficients in the elimination step are nonzero: Ψ_{p-1}^{p+s}(x)≠0 and ψ_{p-1}^{p-t}(x)≠0.
    Section 3.4 introduces this condition as the prerequisite for the rigid formula (55); when it fails, the paper switches to special cases using Q_0, Q_1, or bias terms.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Three-term Recurrence Relation with Arbitrary Degree Steps for Orthogonal Polynomials." pith.science (2026). https://pith.science/paper/TKB2PMQP

@misc{pith2026260613056,
  author       = {Pith},
  title        = {Pith review of: Three-term Recurrence Relation with Arbitrary Degree Steps for Orthogonal Polynomials},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/TKB2PMQP}},
  note         = {Machine review of arXiv:2606.13056}
}
abstract

An approach to generate three-term recurrence relations with arbitrary degree steps is proposed for orthogonal polynomials. Specifically, given any class of orthogonal polynomials $\{Q_{p}(x)\}_{p=0}^{\infty}$ defined by Favard's theorem, we employ the adjacent members $Q_{p}(x)$ and $Q_{p-1}(x)$ to compute $Q_{p+s}(x)$ of high degree and the one of low degree $Q_{p-t}(x)$, where $(s,t)$ are parameters for degree step adjustment. The coefficients of both relations are analyzed, revealing novel properties that enable the derivation of three-term recurrence relations with respect to $Q_{p+s}(x)$, $Q_{p}(x)$ and $Q_{p-t}(x)$ by eliminating $Q_{p-1}(x)$. Furthermore, in addition to the standard recursive formula, which is characterized by degree increase, the formulas for degree decrease and end-to-middle directions are also formulated. Moreover, explicit recurrence relations with 2-degree steps are presented for Hermite, Gegenbauer and Legendre polynomials. The computation precision of the proposed recurrence relations is also compared with that of the standard ones.

Figures

Figures reproduced from arXiv: 2606.13056 by the authors.

Figure 1
Figure 1. Precision comparison with Hermite polynomials. To [PITH_FULL_IMAGE:figures/full_fig_p026_1.png] view at source ↗
Figure 2
Figure 2. Precision comparison with Gegenbauer polynomial [PITH_FULL_IMAGE:figures/full_fig_p027_2.png] view at source ↗
Figure 3
Figure 3. Precision comparison with Legendre polynomials. [PITH_FULL_IMAGE:figures/full_fig_p028_3.png] view at source ↗
Figures from the paper (3 more)
Figure 4
Figure 4. Figure 4: Precision comparison with Hermite polynomials. To [PITH_FULL_IMAGE:figures/full_fig_p029_4.png]
Figure 5
Figure 5. Figure 5: Precision comparison with Gegenbauer polynomial [PITH_FULL_IMAGE:figures/full_fig_p030_5.png]
Figure 6
Figure 6. Figure 6: Precision comparison with Legendre polynomials. [PITH_FULL_IMAGE:figures/full_fig_p031_6.png]

Review history (2 revisions) →

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

36 extracted references · 2 linked inside Pith

  1. [1]

    Favard theore m

    F. Marcellan, R. Alvarez-Nodarse, On the “Favard theore m” and its exten- sions, Journal of Computational and Applied Mathematics 12 7 (1) (2001) 231–254

    2001

  2. [2]

    Castillo, M

    K. Castillo, M. Costa, A. Ranga, D. V eronese, A Favard typ e theorem for orthogonal polynomials on the unit circle from a three term r ecurrence for- mula, Journal of Approximation Theory 184 (1) (2014) 146–16 2

    2014

  3. [3]

    Beardon, The theorems of Stieltjes and Favard, Comput ational Methods and Function Theory 11 (1) (2011) 247–262

    A. Beardon, The theorems of Stieltjes and Favard, Comput ational Methods and Function Theory 11 (1) (2011) 247–262

    2011

  4. [4]

    Marcellan, M

    F. Marcellan, M. Perez-V alero, Y . Quintana, A. Urieles,Recurrence relations and outer relative asymptotics of orthogonal polynomials w ith respect to a discrete Sobolev type inner product, Bulletin of Mathemati cal Sciences 4 (1) (2014) 83–97

    2014

  5. [5]

    Garza, L

    L. Garza, L. Garza, E. Huertas, An analysis of the recurre nce coe fficients for symmetric Sobolev-type orthogonal polynomials, Symme try 13 (534) (2021) 1–14

    2021

  6. [6]

    Cvetkovic, G

    A. Cvetkovic, G. Milovanovic, N. V asovic, Recurrence re lation and di ffer- ential equation for a class of orthogonal polynomials, Resu lts Math 73 (16) (2018) 1–19

    2018

  7. [7]

    Z. Liu, A. Narayan, On the computation of recurrence coe fficients for uni- variate orrthogonal polynomials, Journal of Scientific Com puting 88 (53) (2021) 1–20

    2021

  8. [8]

    Gautschi, G

    W. Gautschi, G. Milovanovic, Orthogonal polynomials re lative to weight functions of prudnikov type, Numerical Algorithms 90 (2) (2 022) 263–270. 32

Show all 36 references
  1. [9]

    G. Milovanovic, Symbolic computation of recurrence coe fficients for poly- nomials orthogonal with respect to the Szego-Bernstein wei ghts, Mathemat- ical Foundations of Computing 6 (3) (2023) 460–473

    2023

  2. [10]

    Filipuk, M

    G. Filipuk, M. Haneczok, W. Assche, Computing recurren ce coefficients of multiple orthogonal polynomials, Numer Algor 70 (1) (2015) 519–543

    2015

  3. [11]

    Swiderski, W

    G. Swiderski, W. Assche, Christo ffel functions for multiple orthogonal poly- nomials, Journal of Approximation Theory 283 (105820) (202 2) 1–22

  4. [12]

    A. Duran, Higher order recurrence relation for excepti onal Charlier, Meixner, Hermite and Laguerre orthogonal polynomials, Int egral Trans- forms and Special Functions 26 (5) (2015) 357–376

    2015

  5. [13]

    Dzhamay, G

    A. Dzhamay, G. Filipuk, A. Stokes, Di fferential equations for the recurrence coefficients of semi-classical orthogonal polynomials and their relation to the Painleve equations via the geometric approach, Studies in A pplied Mathe- matics 148 (4) (2022) 1656–1702

    2022

  6. [14]

    Chihara, A introduction to orthogonal polynomials, Gordon and Breach Science Publishers, New Y ork, London, Paris, 1978

    T. Chihara, A introduction to orthogonal polynomials, Gordon and Breach Science Publishers, New Y ork, London, Paris, 1978

    1978

  7. [15]

    Simon, Orthogonal polynomials on the unit circle, Pa rt 1: Classical the- ory, Colloquium Publications, V olume 54, American Mathematical Society, Providence, RI, 2005

    B. Simon, Orthogonal polynomials on the unit circle, Pa rt 1: Classical the- ory, Colloquium Publications, V olume 54, American Mathematical Society, Providence, RI, 2005

    2005

  8. [16]

    Simon, Orthogonal polynomials on the unit circle, Pa rt 2: Spectral the- ory, Colloquium Publications, V olume 54, American Mathematical Society, Providence, RI, 2005

    B. Simon, Orthogonal polynomials on the unit circle, Pa rt 2: Spectral the- ory, Colloquium Publications, V olume 54, American Mathematical Society, Providence, RI, 2005

    2005

  9. [17]

    Barroso, P

    R. Barroso, P . V era, A Christoffel-Darboux formula and a Favard’s theorem for orthogonal Laurent polynomials on the unit circle, Jour nal of Computa- tional and Applied Mathematics 179 (1) (2005) 157–173

    2005

  10. [18]

    Branquinho, A

    A. Branquinho, A. Foulquie-Moreno, K. Rampazzi, Gener al- ized semiclassical orthogonal polynomials on the unit circ le: A riemann-hilbert perspective, Numerical Algorighm (2025 ) 1– 25doi:10.1007/s11075-025-032197-4

    2025 doi

  11. [19]

    Marcellan, Y

    F. Marcellan, Y . Xu, On Sobolev orthogonal polynomials , Expositiones Mathematicae 33 (3) (2015) 308–352. 33

    2015

  12. [20]

    Aptekarev, Multiple orthogonal polynomials, Journ al of Computational and Applied Mathematics 99 (1) (1998) 423–447

    A. Aptekarev, Multiple orthogonal polynomials, Journ al of Computational and Applied Mathematics 99 (1) (1998) 423–447

    1998

  13. [21]

    Barroso, C

    R. Barroso, C. Mendoza, R. Orive, Multiple orthogonal p olynomials on the unit circle. normality and recurrence relations, Journal of Computational and Applied Mathematics 284 (1) (2015) 115–132

    2015

  14. [22]

    Aptekarev, S

    A. Aptekarev, S. Dobrokhotov, D. Tulyakov, A. Tsvetkov a, Plancherel–Rotach type asymptotic formulae for multiple o rthogonal Hermite polynomials and recurrence relations, Izvestiya: Mathematics 86 (1) (2022) 32–91

    2022

  15. [23]

    Douak, P

    K. Douak, P . Maroni, On a new class of 2-orthogonal polyn omials, I: the recurrence relations and some properties, Integral Transf orms and Special Functions 32 (2) (2021) 134–153

    2021

  16. [24]

    Douak, P

    K. Douak, P . Maroni, On a new class of 2-orthogonal polyn omials, II: the integral representations, Methods and Applications of Analysis 32 (2) (2022) 1–30

    2022

  17. [25]

    Chaggara, A

    H. Chaggara, A. Gahami, Classification of 2-orthogonal polynomials with Brenke type generating functions, Journal of Approxim ation Theory 306 (106125) (2025) 1–23

    2025

  18. [26]

    Gomez-Ullate, N

    D. Gomez-Ullate, N. Kamran, R. Milson, On orthogonal po lynomials span- ningg a non-standard flag, Algebraic Aspects of Darboux Tran sformations, Quantum Integrable Systems and Supersymmetric Quantum Mec hanics, American Mathematical Society, Providence, RI, 2005

    2005

  19. [27]

    S. Odake, Recurrence relations of the multi-indexed or thogonal polynomials IV: closure relations and creation /annihilation operators, Journal of Mathe- matical Physics 57 (113503) (2016) 1–33

    2016

  20. [28]

    Horvath, Recurrence relation and multi-indexed pol ynomials of the sec- ond kind, Acta Mathematica Hungarica 157 (2) (2019) 537–550

    A. Horvath, Recurrence relation and multi-indexed pol ynomials of the sec- ond kind, Acta Mathematica Hungarica 157 (2) (2019) 537–550

    2019

  21. [29]

    J. Kim, M. Song, Combinatorics of generalized orthogon al polynomials of type rii, arXiv (2024) 1–18 doi:10.48550/arXiv.2411.12345

    2024 doi arXiv

  22. [30]

    Ismail, A

    M. Ismail, A. Ranga, RII type recurrence, generalized e igenvalue problem and orthogonal polynomials on the unit circle, Linear Algeb ra and Its Appli- cations 562 (1) (2019) 63–90. 34

    2019

  23. [31]

    Shukla, A

    V . Shukla, A. Swaminathan, Chain sequences and zeros of polynomials re- lated to a perturbed RII type recurrence relation, Journal o f Computational and Applied Mathematics 422 (114916) (2022) 1–24

    2022

  24. [32]

    Shukla, A

    V . Shukla, A. Swaminathan, Spectral transformation as sociated with a per- turbed RI type recurrence relation, Bulletin of the Malaysi an Mathematical Sciences Society 46 (169) (2023) 1–29

    2023

  25. [33]

    Abrammowitz, I

    M. Abrammowitz, I. Stegun, Handbook of mathematical fu nctions with for- mulas, graphs and mathematical tables, Dover Publication, New Y ork, 1965

    1965

  26. [34]

    Schoutens, Stochastic processes and orthogonal pol ynomials, V ol

    W. Schoutens, Stochastic processes and orthogonal pol ynomials, V ol. 146 of Lecture Notes in Statistics, Springer, New Y ork, MA, 2000

    2000

  27. [35]

    Jooste, D

    A. Jooste, D. Tchgeutia, W. Koepf, Recurrence relation s involving di ffer- ent orthogonal polynomial sequences and applications, arX iv (2021) 1– 18doi:10.48550/arXiv.2110.13305

    2021 doi arXiv

  28. [36]

    Y ang, Z

    B. Y ang, Z. Ma, Q. Huang, L. Zhang, Twin orthogonal momen ts: A cou- ple of effective feature descriptors for image representation and re cognition. pattern recognition, Pattern Recognition 177 (113374) (20 26) 1–13. 35

Pith tools

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