Pith. sign in

REVIEW 4 major objections 4 minor 19 references

On Generalized Chebyshev polynomials

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

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

Pith's one-line read This paper defines a three-parameter polynomial family whose rational generating function yields all four Chebyshev kinds and reproduces Fibonacci, Morgan-Voyce, and Fubini relations.

desk verdict Competent re-parameterization of standard recurrence material; the determinant formula is worth a glance, but Theorem 2.4 has an unstated a≠0 gap and the Fubini connection is definitional. read the letter →

arxiv 2607.29661 v1 pith:3TZTLFYG submitted 2026-07-31 math.NT

Taekyun Kim , Dae San Kim This is my paper · ORCID
classification math.NT MSC 11B7311B83
keywords generalizedChebyshevpolynomialsgeneratingfunctiontridiagonaldeterminantMorgan-VoyceFibonacciFubiniEuler-Seidelmatrixcontinuedfraction
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

The paper introduces a three-parameter family of polynomials K_n(x|a,b,c) with the rational generating function (1+cxt)/(1+axt+bt^2) and claims it unifies the four classical kinds of Chebyshev polynomials: setting a=-2, b=1 and choosing c=-1, 0, -1/x, or 1/x yields T_n, U_n, V_n, and W_n respectively. For this family it derives a three-term recurrence, an n by n tridiagonal determinant representation, and explicit closed-form binomial formulas. It also shows that specialized members reproduce Morgan-Voyce and Fibonacci polynomials, and that Fubini polynomials can be written as a finite sum involving K_m(x|-1,0,0) and Stirling numbers of the second kind. If these claims are correct, the paper gives a single compact source from which the standard formulas of several classical polynomial families follow uniformly.

What carries the argument

The generating function (1+cxt)/(1+axt+bt^2) is the central object; expanding it produces the recurrence K_n = -ax K_{n-1} - b K_{n-2}. The constant c acts as a boundary term that changes the initial condition K_1 from -ax to (c-a)x, which is exactly the adjustment that deforms U_n into the third-kind and fourth-kind Chebyshev polynomials. The proof engine for the closed forms is the binomial expansion (1+axt+bt^2)^{-1} = Σ_{m≥0} (-1)^m t^m (ax+bt)^m, whose double-sum reindexing yields the explicit formulas, the determinant representation, and the continued fraction for the ratio of consecutive terms.

What would settle it

Evaluate K_2(x|0,1,1) from the recurrence: K_0=1, K_1=x, K_2 = -0·x·K_1 - 1·K_0 = -1. The closed form in Theorem 2.4 contains c/a and cannot be evaluated at a=0, so the formula does not cover the parameter set the paper claims. A complete theorem would either state a≠0 as a hypothesis or give a separate a=0 formula.

Watch

Extended reading notes

Core claim

The central claim is that the rational function (1+cxt)/(1+axt+bt^2) generates a genuinely unified family: K_n(x|-2,1,-1)=T_n(x), K_n(x|-2,1,0)=U_n(x), K_n(x|-2,1,-1/x)=V_n(x), K_n(x|-2,1,1/x)=W_n(x). The paper establishes the recurrence K_n = -ax K_{n-1} - b K_{n-2} with K_0=1 and K_1=(c-a)x, an n×n tridiagonal determinant formula, and a closed form as a sum of binomial coefficients. It further proves a closed form for T_n(x|a,b), identifies T_{2n}(x|1,-1) with the Morgan-Voyce polynomial b_n(x^2), identifies T_{n-1}(x|-1,-1) with the Fibonacci polynomial f_n(x), and expresses Fubini polynomials as F_n(x)=Σ_{m=0}^n K_m(x|-1,0,0) {n choose m} m!.

Load-bearing premise

Theorem 2.4's closed form divides by a through the c/a term, so the paper silently assumes a is nonzero, even though the generating function, recurrence, and determinant formulas are all valid when a=0; for a=0 the stated closed form is undefined.

Editorial extensions

If this is right

  • The four classical Chebyshev kinds and their standard closed forms, determinant formulas, and recurrences all follow from a single parameterized generating function.
  • Identities proved once for K_n(x|a,b,c) specialize to identities for T_n, U_n, V_n, and W_n by substituting parameter values.
  • The tridiagonal determinant representation transfers to Morgan-Voyce and Fibonacci polynomials, since T_{2n}(x|1,-1)=b_n(x^2) and T_{n-1}(x|-1,-1)=f_n(x).
  • Fubini polynomials gain a new expression as a finite Stirling-weighted sum of K_m(x|-1,0,0), connecting combinatorial and special-function literatures.
  • The Euler-Seidel matrix and continued fraction for K_n/K_{n-1} apply uniformly to all four Chebyshev kinds and to the specialized sequences.

Reading between the lines

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

  • The parameter c appears only in the numerator, so K_n is essentially T_n (the c=0 family) plus a c-dependent correction; this suggests a deformation or perturbation interpretation that the paper does not spell out.
  • The a=0 cases are well-defined by the recurrence and determinant but excluded silently from the closed form (division by a); handling a=0 separately would complete the parameter range.
  • One could test whether the framework extends to higher-order rational generating functions (e.g., cubic denominators) or to q-analogues; the recurrence-and-determinant pattern is likely to persist.
  • The continued fraction for K_n/K_{n-1} resembles a Stieltjes-type continued fraction, hinting at measure or orthogonality questions that the paper leaves unexplored.
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

4 major / 4 minor

Summary. The paper introduces a family K_n(x|a,b,c) via the rational generating function (1+cxt)/(1+axt+bt^2) = sum K_n t^n (Eq. 13), and shows that the four classical Chebyshev families are special cases. It derives a three-term recurrence (16), a tridiagonal determinant (Theorem 2.1), closed forms for the subfamily T_n(x|a,b) and for K_n (Theorems 2.3 and 2.4), and connections to Morgan-Voyce polynomials (Theorem 2.5), Fibonacci polynomials (Corollary 2.7), and Fubini polynomials (Theorem 2.8). Section 3 discusses the Euler-Seidel matrix and gives a continued fraction for the quotient of consecutive polynomials.

Significance. If fully correct, the framework is a compact notational unification: one generating function, recurrence, determinant, and closed form package the four Chebyshev kinds and several related sequences. The basic manipulations in (13)–(24) are standard and, apart from the domain issue in Theorem 2.4, the algebra checks out. The classical specializations are correctly identified. The paper is not deep—most results are direct generating-function computations—but it could serve as a useful consolidated reference. Credit is due for the explicit determinant and recurrence and for correctly recognizing the Chebyshev specializations; however, the Fubini 'connection' is essentially a rewording of the definition, and the continued fraction display in Section 3 is not correct as written.

major comments (4)
  1. [§2, Theorem 2.4 / Eq. (24)] The closed form is stated for arbitrary a,b,c and n≥1, but the second sum contains c/a, so it is undefined when a=0. The generating function (13), recurrence (16), and determinant (Theorem 2.1) are all valid at a=0; for example, with (a,b,c)=(0,1,1), (13) gives K_2(x|0,1,1)=-1, while Theorem 2.4 cannot be evaluated. The derivation factors (ax)^{n-2k}, which requires a≠0. Please state a≠0 and handle a=0 separately (the generating function reduces to (1+cxt)/(1+bt^2)), or replace the c/a expression by the appropriate limit. The Chebyshev specializations have a=-2, so they are unaffected, but the theorem's stated domain is false.
  2. [§2, Theorem 2.8] By (13) with (a,b,c)=(-1,0,0), K_m(x|-1,0,0)=x^m. Substituting this into Theorem 2.8 reproduces exactly the definition (7) of Fubini polynomials. Thus the theorem is true but tautological: it is a restatement of the definition rather than a new structural connection. It should be presented as a specialization/observation, and the claim that Fubini polynomials are 'expressed in terms of' the generalized Chebyshev polynomials is overstated, since the Chebyshev polynomial involved is simply x^m.
  3. [§2, Theorem 2.3] The formula divides by sqrt((ax)^2-4b). When (ax)^2=4b the denominator vanishes, even though T_n(x|a,b) is a polynomial and is defined for all x. In the standard Chebyshev case (a,b)=(-2,1) this happens at x=±1. The theorem needs an explicit limiting convention or a separate statement for the repeated-root case; otherwise the claimed domain 'n≥0' with no restriction on x is inaccurate.
  4. [§3, final Remark (continued fraction)] The displayed continued fraction for K_n(x|a,b,c)/K_{n-1}(x|a,b,c) is not valid as written for all n. For (a,b,c)=(-2,1,0) and n=3, the displayed expression -ax + b/(ax + b/(ax-cx)) becomes 2x+1/(-2x+1/(-2x)) = 8x^3/(4x^2+1), while (15)–(16) give K_3/K_2 = (8x^3-4x)/(4x^2-1). The terminal denominator appears to alternate between (a-c)x and (c-a)x. Please derive the finite continued fraction by iterating r_n = -ax - b/r_{n-1} and state the correct termination rule, including the parity of n.
minor comments (4)
  1. [§2, Theorem 2.4 statement] The statement reads 'K_n(x|a,b,c) =' with a mismatched parenthesis; it should be 'K_n(x|a,b,c) =' or similar. This makes the theorem harder to read as typeset.
  2. [§1 and §5] Typographical slips: 'Cheyshev' for 'Chebyshev' in the paragraph defining V_n and W_n, and 'CONFLICT OF INTERES' should be 'CONFLICT OF INTEREST'.
  3. [§2, Eq. (24)] The expansion of 1/(1+axt+bt^2) is a formal power series; no convergence conditions are needed. It would help to say explicitly that all manipulations are formal, so readers do not wonder about the domain of t.
  4. [§3, Euler-Seidel matrix] Only the first few entries of the Euler-Seidel matrix are displayed. A general formula for a_{k,n}(x) would make the section more useful and easier to verify.

Circularity Check

1 steps flagged · score 6.0 of 10

The Fubini-polynomial 'connection' (Theorem 2.8) reduces to the definition of Fubini polynomials, since K_m(x|-1,0,0)=x^m by (13).

  1. renaming known result [Section 2, Theorem 2.8, via Eqs. (33)-(34); with Eq. (13) and Eq. (7)]
    "The Fubini polynomials (or geometric polynomials) are defined by [16, 19] (7) F_n(x) = sum_{k=0}^n {n \choose k} k! x^k, (n>=0). ... From (6), (7) and (13), we note that sum_{m=0}^\infty K_m(x|-1,0,0)(e^t-1)^m = 1/(1-x(e^t-1)) ... = sum_{n=0}^\infty F_n(x) t^n/n!. ... Therefore, by (33) and (34), we obtain the following theorem. Theorem 2.8. For n>=0, we have F_n(x) = sum_{m=0}^n K_m(x|-1,0,0) {n \brace m} m!."

    Setting (a,b,c)=(-1,0,0) in the defining generating function (13) gives 1/(1-xt)=sum_{m>=0} K_m(x|-1,0,0) t^m, hence K_m(x|-1,0,0)=x^m. Substituting this identity into Theorem 2.8 makes the right side exactly sum {n \brace m} m! x^m, which is the definition of F_n(x) in Eq. (7). Thus Theorem 2.8 is not a consequence of the generalized Chebyshev framework; it is the definition of Fubini polynomials with x^m renamed as K_m(x|-1,0,0). The derivation in (33)-(34) only verifies that the Fubini exponential generating function is equal to itself.

full rationale

The rest of the paper's derivation chain is self-contained. K_n(x|a,b,c) is defined by the generating function (13); the recurrence (16), the tridiagonal determinant (Theorem 2.1), the explicit coefficient expansions (Theorems 2.3, 2.4, and 2.6), and the Morgan-Voyce / Fibonacci connections (Theorems 2.5 and 2.7) are derived within the paper from formal power-series manipulations and summation identities, not from fitted data or unverified prior results. The four classical Chebyshev specializations are immediate parametric checks of the same generating function. No load-bearing self-citation chain is used; the bibliography's self-citations are background references. There is a genuine correctness gap in Theorem 2.4: the displayed closed form contains c/a, so it is undefined for a=0 even though (13) and Theorem 2.1 cover a=0; that is a missing domain restriction, not circularity. The one circular step is Theorem 2.8, where the 'connection' to Fubini polynomials reduces by construction to the definition (7) because the generalized Chebyshev polynomial at the chosen parameters is just the monomial x^m.

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

a, b, c are definitional symbols in (13), not fitted values; the specializations to classical families (a=-2, b=1, c in {0,-1,-1/x,1/x}) are exact recaptures of known generating functions, not tuned numbers. No constants are fitted to data, and no ad hoc entity is introduced: K_n(x|a,b,c) is the object of study, defined directly by (13), and carries no independent falsifiable handle beyond the identities proven here.

assumptions (5)
  • standard math Formal power-series expansion: 1/(1+axt+bt^2) = sum (-1)^m t^m (ax+bt)^m, and re-indexing of the double sum in Eq. (24) are valid as formal series in t.
    Used in Theorem 2.4 and Theorem 2.6. The paper treats t as a formal variable, so convergence is not required, but no domain statement is made.
  • standard math Sequences satisfying X_{n+2}+ax X_{n+1}+b X_n=0 have the closed form given in Eq. (22), holding when the characteristic roots are distinct.
    Basis of Theorem 2.3; the paper does not discuss the boundary case (ax)^2=4b.
  • domain assumption a is nonzero in Theorem 2.4, because the closed form contains c/a.
    Theorem 2.4 is stated for n>=1 with no domain restriction, while the definition (13) and determinant (Corollary 2.2) are valid for a=0.
  • standard math Background closed forms for Chebyshev (Eq. 10), Fibonacci (Eq. 4), Morgan-Voyce (Eq. 27), and Fubini (Eq. 7) polynomials as cited from [1,2,12,13,16,17,18,19] are correct.
    Needed for Theorems 2.5, 2.7, and 2.8; these are classical results the paper relies on without re-derivation.
  • standard math Euler's formula A(t) = (1/(1-t)) A(t/(1-t)) for the binomial transform in Section 3, Eq. (36).
    Used to justify the Euler-Seidel claims; standard identity for adjacent-sum triangles.

how reviews work

0 comments
Cite this review

Pith. "Pith review of On Generalized Chebyshev polynomials." pith.science (2026). https://pith.science/paper/3TZTLFYG

@misc{pith2026260729661,
  author       = {Pith},
  title        = {Pith review of: On Generalized Chebyshev polynomials},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/3TZTLFYG}},
  note         = {Machine review of arXiv:2607.29661}
}
read the original abstract

In this paper, we introduce and study a novel family of generalized Chebyshev polynomials defined via a rational generating function. We demonstrate that the classical Chebyshev polynomials of the first, second, third, and fourth kinds naturally emerge as special cases of this framework. Furthermore, we derive comprehensive recurrence relations, tridiagonal determinant representations, and explicit closed-form expressions for these polynomials. We also establish some connections between the generalized Chebyshev polynomials and other classical sequences, including Morgan-Voyce polynomials, Fibonacci polynomials, and Fubini polynomials via Stirling numbers of the second kind. Finally, we examine the associated Euler-Seidel matrix and provide a continued fraction expansion for the quotient of consecutive polynomial terms.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

19 extracted references

  1. [1]

    A.Handbook of mathematical functions with formulas, graphs, and mathematical tables,National Bureau of Standards Applied Mathematics Series, No

    Abramowitz, M.; Stegun, I. A.Handbook of mathematical functions with formulas, graphs, and mathematical tables,National Bureau of Standards Applied Mathematics Series, No. 55, U. S. Government Printing Office, Washington, DC, 1964

    1964

  2. [2]

    T.; Atanassova, V .; Shannon, A

    Atanassov, K. T.; Atanassova, V .; Shannon, A. G.; Turner, J. C.New visual perspectives on Fibonacci numbers. With a foreword by A. F . Horadam.World Scientific Publishing Co., Inc., River Edge, NJ, 2002. xvi+313 pp. ISBN: 981-238-134-1

    2002

  3. [3]

    The art of finite and infinite expansions,Revised and en- larged edition, D

    Comtet, L.Advanced combinatorics. The art of finite and infinite expansions,Revised and en- larged edition, D. Reidel Publishing Co., Dordrecht, 1974

    1974

  4. [4]

    S.Degenerate algorithms for degenerate Bernoulli and Euler numbers,Geor- gian Mathematical Journal

    Kim, T.; Kim, D. S.Degenerate algorithms for degenerate Bernoulli and Euler numbers,Geor- gian Mathematical Journal. https://doi.org/10.1515/gmj-2026-3022

    doi:10.1515/gmj-2026-3022 2026

  5. [5]

    S.Degenerate Euler-Seidel matrix method and their applications,Math

    Kim, T.; Kim, D. S.Degenerate Euler-Seidel matrix method and their applications,Math. Meth- ods Appl. Sci.49(2026), no. 8, 8209-8223

    2026

  6. [6]

    S.Degenerate r-Bell Numbers and Coherent States,Russ

    Kim, T.; Kim, D. S.Degenerate r-Bell Numbers and Coherent States,Russ. J. Math. Phys.33 (2026), no. 2, 332-339

    2026

  7. [7]

    S.Heterogeneous Stirling numbers and heterogeneous Bell polynomials,Russ

    Kim, T.; Kim, D. S.Heterogeneous Stirling numbers and heterogeneous Bell polynomials,Russ. J. Math. Phys.32(2025), no. 3, 498-509

    2025

  8. [8]

    S.Spivey-type recurrence relations for degenerate Bell and Dowling polyno- mials,Russ

    Kim, T.; Kim, D. S.Spivey-type recurrence relations for degenerate Bell and Dowling polyno- mials,Russ. J. Math. Phys.32(2025), no. 2, 288-296

    2025

Show all 19 references
  1. [9]

    S.; Dolgy, D

    Kim, T.; Kim, D. S.; Dolgy, D. V .; Park, J.-W.Sums of finite products of Chebyshev polynomials of the second kind and of Fibonacci polynomials,J. Inequal. Appl. 2018, Paper No. 148, 14 pp

    2018

  2. [10]

    S.; Lee, H.; Hwang, K.-S.Degenerate Euler-Seidel method for degenerate Bernoulli, Euler, and Genocchi polynomials,Netw

    Kim, T.; Kim, D. S.; Lee, H.; Hwang, K.-S.Degenerate Euler-Seidel method for degenerate Bernoulli, Euler, and Genocchi polynomials,Netw. Heterog. Media21(2026), no. 2, 551-563

    2026

  3. [11]

    2, 204-215

    Kishore, J.; Verma, V .Some identities involving Chebyshev polynomials, Fibonacci polynomi- als and their derivatives,Notes on Number Theory and Discrete Mathematics29(2023), no. 2, 204-215. 10 TAEKYUN KIM AND DAE SAN KIM

    2023

  4. [12]

    Koshy, T.Fibonacci and Lucas numbers with applications,Pure and Applied Mathematics, Wiley-Interscience, New York, 2001

    2001

  5. [13]

    40(2002), no

    Lee, Jack Y .On the Morgan-Voyce polynomial generalization of the first kind,Fibonacci Quart. 40(2002), no. 1, 59-65

    2002

  6. [14]

    K.Regular polygons, Morgan-Voyce polynomials, and Chebyshev polynomials, Notes on Number Theory and Discrete Mathematics27(2021), no

    Merikoski, J. K.Regular polygons, Morgan-Voyce polynomials, and Chebyshev polynomials, Notes on Number Theory and Discrete Mathematics27(2021), no. 2, 79-87

    2021

  7. [15]

    L.; Whitaker, R

    Ollerton, R. L.; Whitaker, R. N.First-order recurrence relations for the Chebyshev polynomials and associated function,Notes on Number Theory and Discrete Mathematics4(1998), no. 3, 123-128

    1998

  8. [16]

    A.; Khan, W

    Pathan, M. A.; Khan, W. A.Three-variable higher-order Gould-Hopper based Fubini numbers and polynomials,Palest. J. Math.15(2026), Special Issue I, 1-14

    2026

  9. [17]

    Swamy, M. N. S.Further properties of Morgan-Voyce polynomials,Fibonacci Quart.6(1968), no. 2, 167-175

    1968

  10. [18]

    Swamy, M. N. S.Rising diagonal polynomials associated with Morgan-Voyce polynomials, Fibonacci Quart.38(2000), no. 1, 61-70

    2000

  11. [19]

    35, 12635-12646

    Xu, R.; Ma, Y .i; Kim, T.; Hei, Y .Probabilistic bivariate Fubini polynomials and probabilistic degenerate bivariate Fubini polynomials,Filomat39(2025), no. 35, 12635-12646. DEPARTMENT OFMATHEMATICS, KWANGWOONUNIVERSITY, SEOUL139-701, REPUBLIC OFKOREA Email address:tkkim@kw.ac...

    2025

Pith tools

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