Pith. sign in

REVIEW 3 major objections 3 minor 23 references

Study on Morgan-Voyce type polynomials with Euler-Seidel algorithm

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 ↗

Pith's one-line read This paper defines new Morgan-Voyce type polynomials and proves that three binomial-type sums of Bell polynomials equal finite sums of these polynomials, with degenerate λ-analogues via the Euler-Seidel matrix.

desk verdict Solid, workmanlike elementary combinatorics; Theorem 3.7 is false as printed due to a sign error, and the claimed new M_n/N_n families are just n! times the classical Morgan–Voyce polynomials—fix the typos and you have a routine but acceptable paper. read the letter →

arxiv 2607.13489 v1 pith:HX4GT5IU submitted 2026-07-15 math.NT

Taekyun Kim , Dae san Kim This is my paper · ORCID
classification math.NT MSC 11B7311B83
keywords Morgan-VoycepolynomialsEuler-SeidelmatrixdegenerateBellStirlingnumbersexponentialgeneratingfunctionscombinatorialidentities
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 aims to connect Morgan-Voyce polynomials, Bell polynomials, and the Euler-Seidel matrix method. It introduces two new families M_n and N_n, derives explicit binomial-coefficient formulas and recurrences, then defines three variants K_n, J_n, L_n by inserting 1/k! factors and taking differences. For each variant it proves a binomial-type identity that rewrites a Bell-polynomial convolution as a finite sum of the new polynomials, and it gives the exponential generating functions. Finally, it constructs degenerate λ-analogues K_{n,λ}, J_{n,λ}, L_{n,λ} and shows they fit a degenerate Euler-Seidel matrix framework. If correct, these identities supply new finite-sum evaluations and extend a matrix-based proof technique to degenerate special polynomials.

What carries the argument

The Euler-Seidel matrix recurrence a_{k,n}=a_{k-1,n}+a_{k-1,n+1} (and its degenerate form a_{k,n}=(1-(k-n)λ)a_{k-1,n}+a_{k-1,n+1}) turns an initial sequence into binomial sums like a_{n,0}=∑ binom(n,k)a_{0,k}. The engine of the paper is the power-series substitution t→1−e^{−t}: inserting it into the generating functions for K_n, J_n, L_n converts the functions into products of Bell-polynomial generating functions, which is how the binomial-type identities are obtained. The defining explicit formulas for M_n and N_n with binomial coefficients binom(n+k+1,n-k) and binom(n+k,n-k) are the concrete objects that the matrix method manipulates.

What would settle it

Evaluate both sides of Theorem 3.7 at n=2 and x=1, using L_0(1)=1, L_1(1)=1, L_2(1)=5 and Bell polynomials φ_0(1)=1, φ_1(1)=1, φ_2(1)=2; the left side gives 14 and the right side gives 4, so the printed identity fails.

Watch

Extended reading notes

Core claim

The central claim is that the new polynomials M_n(x)=n!∑ binom(n+k+1,n-k)x^k and N_n(x)=n!∑ binom(n+k,n-k)x^k, once rescaled to K_n, J_n, L_n, turn three Bell-polynomial binomial sums into finite polynomial sums (Theorems 3.4, 3.6, 3.7). The paper also derives their exponential generating functions, constructs Euler-Seidel matrices from them, and defines degenerate λ-versions K_{n,λ}, J_{n,λ}, L_{n,λ} connected by relations in Section 4. If the identities hold, they provide explicit finite evaluations for a family of Bell convolutions.

Load-bearing premise

The Section 4 degenerate results rest on the degenerate Euler-Seidel matrix relation (10)/(12), quoted from the authors' earlier work without proof; if that relation is wrong, the degenerate formulas and matrices do not follow.

Editorial extensions

If this is right

  • Theorems 3.4, 3.6, 3.7 give finite closed-form evaluations for alternating Stirling-weighted sums of K_n, J_n, L_n in terms of Bell polynomial convolutions.
  • The generating function ∑ K_n(x) t^n/n! = (1-t)^{-2} e^{xt/(1-t)^2} places these polynomials in a family where coefficient extraction and asymptotic analysis is direct.
  • The degenerate Euler-Seidel formula (49) expresses the bottom row in terms of L_{k,λ} with falling-factorial weights (1−λ)_{n−k,λ}, generalizing the standard binomial transform.
  • The relations between K and J, and between J and L (Theorems 3.5, 3.8) reduce computation of these polynomials to iterated binomial/Stirling sums.

Reading between the lines

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

  • A direct symbolic check of Theorem 3.7 for n=0,1,2 against the defining L_k(x) formulas would provide a quick consistency test of the claimed Bell-sum identity.
  • The binomial coefficients binom(n+k+1, n-k) that appear throughout suggest a possible connection to ballot or Narayana numbers; if so, the polynomials may have a lattice-path interpretation not explored in the paper.
  • The substitution trick t→1−e^{−t} is likely reusable with other substitutions, such as t→1−(1−t)^m, to generate m-ary analogues of these Bell identities with a free parameter m.
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 introduces two Morgan-Voyce type polynomial families M_n(x), N_n(x) and three variants K_n(x), J_n(x), L_n(x). It derives explicit formulas (Theorem 3.1, Corollaries 3.2 and 3.3), recurrences, generating functions, and three binomial-type identities connecting Bell polynomials to K_n, J_n, L_n (Theorems 3.4, 3.6, 3.7). The second half defines degenerate variants K_{n,λ}(x), J_{n,λ}(x), L_{n,λ}(x), proves structural relations (Theorems 4.1, 4.2), and embeds them in the degenerate Euler-Seidel matrix framework. The derivations are self-contained except for the imported degenerate Euler-Seidel relation (10)/(12).

Significance. If the printed statements are corrected, the results are new and largely elementary but useful identities; they extend the authors' prior degenerate Euler-Seidel program to Morgan-Voyce polynomials. The paper has no fitted parameters, and the Bell identities are concrete and checkable, which is a strength. However, the central Section 3 contains a false theorem as printed, so the current version is not reliable.

major comments (3)
  1. [Theorem 3.7] As printed, this theorem is false. Eq. (36) gives a coefficient involving φ_{n-k}(-x), but the theorem states φ_{n-k}(x). For n=2, x=1 the printed LHS is 14 and the printed RHS is 4; replacing φ_{n-k}(x) by φ_{n-k}(-x) in Eq. (36) gives LHS=4, matching the RHS. This is a load-bearing identity in the paper's central claim and must be corrected in the statement and in the text.
  2. [Theorem 3.1] The first displayed identity in Theorem 3.1, 'N_n(x)=M_n(x)-nN_{n-1}(x)', is inconsistent with the derivation (17), which proves N_n(x)=M_n(x)-nM_{n-1}(x). The recurrence (14) and the subsequent proof use the M-version. Please correct the typo.
  3. [§4, Eq. (10)/(12)] The degenerate Euler-Seidel relation (10), and its EGF version (12), are stated as known from [11,12] and are used to derive (48)-(49) and the matrix display. Since Section 4's connection to the degenerate Euler-Seidel framework depends on this relation, the paper should provide a short self-contained proof (it follows by induction from (9)) or at least state it as an explicit imported lemma.
minor comments (3)
  1. [Section 3, cross-references] Several references to equations are incorrect: 'in (2)' after Corollary 3.3 should be 'in (7)', and 'Seidel's formula in (12)' should be '(11)' for the standard (non-degenerate) Euler-Seidel matrix. The same issue appears in the K, J, and L subsections.
  2. [Eq. (26)] The phrase 'recalling (9)' before Eq. (26) should probably refer to the Bell polynomial generating function (6), not (9). Please check.
  3. [Eq. (33)] The definition L_n(x)=J_n(x)-nJ_{n-1}(x) for n≥0 is undefined at n=0 because J_{-1} is not defined. Specify L_0(x)=1 and state the recurrence for n≥1.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular derivation: Section 3 identities are derived from explicit definitions; the only unproved import is an elementary degenerate Euler-Seidel relation, and the main risk is a false printed identity, not circularity.

full rationale

The paper's central Section 3 results (Theorems 3.4, 3.6, 3.7, 3.8) are not assumed in their inputs. The polynomials M_n and N_n are defined by the recurrences in (14); the explicit formula (20) is proved by induction from (18) and (19), and K_n, J_n, L_n are defined by the explicit finite sums in (22), (23), and (34). Their exponential generating functions (25), (30), and (35) are derived by direct binomial-coefficient manipulation, and the Bell identities then follow by substituting t=1-e^{-t} and comparing coefficients with Stirling-number expansions (27), (32), and (37). Each step is a computation from the definitions, so no result is a fitted prediction or a renamed input. The only imported, unproved input is the degenerate Euler-Seidel relation (10)/(12), cited to the authors' own prior work [11,12]; however, that relation is a direct consequence of the recurrence (9) and is used as a tool in Section 4, not as the source of the target identities, so the reliance is a self-citation and an omitted proof but not a circular reduction. For completeness: Theorem 3.7 as printed is numerically false (at n=2, x=1 it gives 14=4), because the derivation (36) requires phi_{n-k}(-x), not phi_{n-k}(x); and Theorem 3.1 contains an index typo (N_{n-1} should be M_{n-1}). These are correctness defects, not circularity, and do not change the score.

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

The paper introduces no new physical or mathematical entities beyond the polynomial families themselves. λ is a standard formal deformation parameter, not a fitted constant. The main external inputs are known generating functions and the Euler-Seidel framework from prior work.

free parameters (1)
  • λ
    Formal nonzero real deformation parameter for the degenerate variants; not fitted to data and specializes to the classical case as λ→0.
assumptions (5)
  • standard math Standard Stirling-number and Bell-polynomial generating functions, Eqs (4) and (6).
    Used as the starting point for the Bell-polynomial identities and the coefficient comparisons in Section 3.
  • domain assumption Euler-Seidel matrix recurrence and its exponential-generating-function equivalence, Eqs (7)-(12), including the degenerate version.
    Imported from the authors' prior papers [11,12]; the Section 4 matrix formulas rely on it without proof.
  • standard math Binomial generating-function identity ∑_{n≥k} binom(n+a,n-k) t^n = t^k/(1-t)^{a+k+1}.
    Used repeatedly in Section 3 to pass from explicit binomial sums to generating functions.
  • standard math Degenerate logarithm identities e_λ(log_λ(1/(1-t)))=1/(1-t) and log_λ(1/(1-t))=-log_{-λ}(1-t).
    Used in the derivation of Theorem 4.2 in Eq (47).
  • standard math Formal power series substitutions such as t→1-e^{-t} preserve identities.
    Standard in combinatorics; used throughout Section 3 to derive the Bell identities.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Study on Morgan-Voyce type polynomials with Euler-Seidel algorithm." pith.science (2026). https://pith.science/paper/HX4GT5IU

@misc{pith2026260713489,
  author       = {Pith},
  title        = {Pith review of: Study on Morgan-Voyce type polynomials with Euler-Seidel algorithm},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/HX4GT5IU}},
  note         = {Machine review of arXiv:2607.13489}
}
read the original abstract

This paper bridges the domains of degenerate special polynomials, the Euler-Seidel matrix method, and Morgan-Voyce polynomials. We introduce two new families of Morgan-Voyce type polynomials and establish their structural properties, including explicit formulas and recurrence relations. Additionally, we define three polynomial variants and prove that three distinct binomial-type sums for Bell polynomials can be expressed as finite sums involving these new families, and derive their exponential generating functions. We then construct Euler-Seidel matrices using the initial sequences associated with Morgan-type polynomials. Our results yield novel algebraic identities and expand the application of matrix methods in combinatorial analysis.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

23 extracted references · 1 canonical work pages

  1. [1]

    L.The appearance of Fibonacci numbers and the Q matrix in electrical network theory, Math

    Basin, S. L.The appearance of Fibonacci numbers and the Q matrix in electrical network theory, Math. Mag.36(1963), no.2, 84-97

    1963

  2. [2]

    L.An Application of Continuants,Math

    Basin, S. L.An Application of Continuants,Math. Mag.37(1964), no. 2, 83-91

    1964

  3. [3]

    Z.The r-Stirling numbers,Discrete Math.49(1984), no

    Broder, A. Z.The r-Stirling numbers,Discrete Math.49(1984), no. 3, 241-259. STUDY ON MORGAN-VOYCE TYPE POLYNOMIALS WITH EULER-SEIDEL ALGORITHM 15

    1984

  4. [4]

    Carlitz, L.Degenerate Stirling, Bernoulli and Eulerian numbers,Utilitas Math.15(1979), 51-88

    1979

  5. [5]

    Carlitz, L.A degenerate Staudt-Clausen theorem,Arch. Math. (Basel)7(1956), 28-33

    1956

  6. [6]

    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

  7. [7]

    A.; Kamarujjama, M.A note on type 2 degenerate multi-Bernoulli polynomials of the second kind,Proc

    Khan, W. A.; Kamarujjama, M.A note on type 2 degenerate multi-Bernoulli polynomials of the second kind,Proc. Jangjeon Math. Soc.25(2022), no. 1, 59-68

    2022

  8. [8]

    S.; Kim, T.Probabilistic degenerate logarithm and heterogeneous Stirling numbers, Kuwait J

    Kim, D. S.; Kim, T.Probabilistic degenerate logarithm and heterogeneous Stirling numbers, Kuwait J. Sci.53(2026), no. 3, Paper No. 100579, 9 pp

    2026

Show all 23 references
  1. [9]

    K.; Lee, D

    Kim, H. K.; Lee, D. S.Some identities of degenerate r-extended Lah-Bell polynomials,Proc. Jangjeon Math. Soc.24(2021), no. 1, 47-61

    2021

  2. [10]

    S.Recurrence relations for degenerate Bell and Dowling polynomials via Boson operators,Comput

    Kim, T.; Kim, D. S.Recurrence relations for degenerate Bell and Dowling polynomials via Boson operators,Comput. Math. Math. Phys.65(2025), no. 9, 2087-2096

    2025

  3. [11]

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

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

    2026

  4. [12]

    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

  5. [13]

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

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

    2026 doi

  6. [14]

    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

  7. [15]

    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

  8. [16]

    Lee, S.-H.Degenerate r-Stirling Genocchi polynomials,Adv. Stud. Contemp. Math. (Kyung- shang)35(2025), no. 4, 335-344

    2025

  9. [17]

    H.A note on probabilistic degenerate poly Lah-Bell polynomials,Adv

    Lee, S. H.A note on probabilistic degenerate poly Lah-Bell polynomials,Adv. Stud. Contemp. Math. (Kyungshang)36(2026), no. 1, 11-16

    2026

  10. [18]

    Morgan-V oyce. A. M.Ladder network analysis using Fibonacci numbers,ITE. Transactions on Circuit Theory V ol CT-6, Sept. 1959, 321-322

    1959

  11. [19]

    Pure and Applied Mathematics,111, Academic Press, Inc

    Roman, S.The umbral calculus. Pure and Applied Mathematics,111, Academic Press, Inc. [Harcourt Brace Jovanovich, Publishers], New York, 1984

    1984

  12. [20]

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

    1968

  13. [21]

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

    2000

  14. [22]

    Swamy, M. N. S.Generalizations of modified Morgan-Voyce polynomials,Fibonacci Quart.38 (2000), no. 1, 8-16

    2000

  15. [23]

    Tuladhar, B. M. ; L ´opez-Bonilla, J.; Salas-Torres, O.An identity for Stirling numbers of the second kind,J. Sci. Eng. Technol.13(2017), no. 1, 95-97. DEPARTMENT OFMATHEMATICS, KWANGWOONUNIVERSITY, SEOUL139-701, REPUBLIC OFKOREA Email address:tkkim@kw.ac.kr DEPARTMENT OFMATHE...

    2017

Pith tools

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