REVIEW
Spivey-type recurrence relation for fully degenerate Bell polynomials
Number Theory · Submitted 6 Sep 2025 · 23 references
Pith's verdict: Correct but routine Spivey-type identities for two more degenerate families; the math checks out, and it deserves peer review for a specialist journal.
Why Pith says this
Highlight any text to comment on it.
Referee report
The paper
The paper claims
This paper proves that fully degenerate Bell polynomials satisfy a double-sum recurrence involving degenerate Stirling numbers and two-variable degenerate Fubini polynomials, with a parallel identity for degenerate Fubini polynomials…
The reading
What carries the argument
The mechanism is the degenerate exponential $e_\lambda(t)=(1+\lambda t)^{1/\lambda}$ and its addition formula $e_\lambda(x+y)=e_\lambda(x)e_\lambda(y/(1+\lambda x))$, which factors $e_\lambda(x+y)-1$ into a part depending on $x$ and a part depending on $y$. Expanding the $y$-factor with the generating-function identity $\frac{1}{k!}(e_\lambda(t)-1)^k=\sum_{n\ge k}\binom{n}{k}_{\lambda}t^n/n!$ introduces the degenerate Stirling numbers, while the $x$-factor is recognized as the generating function of the two-variable degenerate Fubini polynomials. Coefficient comparison in the two-variable generating function then assembles the double sums. The same factorization runs through all three theorems, so the addition formula is the load-bearing algebraic step.
Extended reading notes
Core claim
On the paper's own terms, the central discovery is Theorem 2.2: for every $m,n\ge 0$ and $\lambda\ne 0$, $$\mathrm{Bel}_{n+m,\$\lambda$}(t)=\sum_{k=0}^{m}\sum_{l=0}^{n}(1)_{k,\$\lambda$}\binom{m}{k}_{\$\lambda$}\binom{n}{l}$t^{{k}}$$F^{{(k)}}$_{n-l,\$\lambda$}(-\$\lambda$ t,k-m\$\lambda$)\,\mathrm{Bel}_{l,\$\lambda$}(t),$$ where $\mathrm{Bel}_{n,\lambda}(t)$ are the fully degenerate Bell polynomials, $\binom{m}{k}_{\lambda}$ are degenerate Stirling numbers of the second kind, and $F^{(k)}_{n,\lambda}(x,y)$ are two-variable degenerate Fubini polynomials of order $k$. Theorem 2.3 gives the analogous identity $$F_{n+m,\$\lambda$}(t)=\sum_{k=0}^{m}\sum_{l=0}^{n}k!\binom{m}{k}_{\$\lambda$}\binom{n}{l}$t^{{k}}$$F^{{(k)}}$_{n-l,\$\lambda$}(t,k-m\$\lambda$)\,F_{l,\$\lambda$}(t)$$ for degenerate Fubini polynomials. A first pass with $t=1$ yields the number-level identity of Theorem 2.1. Both polynomial identities are meant to hold as formal power series in $t$, and the paper shows that taking $\lambda\to 0$ recovers the classical Spivey-type recurrences for ordinary Bell polynomials and Fubini polynomials, with the Bell limit reading $\varphi_{n+m}(t)=\sum_{k,l}\binom{m}{k}\binom{n}{l}t^k k^{n-l}\varphi_l(t)$.
Load-bearing premise
The load-bearing premise is that the degenerate-exponential addition formula $e_\lambda(x+y)=e_\lambda(x)e_\lambda(y/(1+\lambda x))$ is a valid formal power-series identity; all three recurrences are obtained from this factorization, and the paper invokes it without proof.
Editorial extensions
If this is right
- Setting $t=1$ in Theorem 2.2 gives a Spivey-type recurrence for the fully degenerate Bell numbers $\mathrm{Bel}_{n+m,\lambda}$, and the same specialization in Theorem 2.3 gives a recurrence for degenerate Fubini numbers.
- Letting $\lambda\to 0$ recovers exactly the classical Bell-polynomial recurrence $\varphi_{n+m}(t)=\sum_{k=0}^m\sum_{l=0}^n\binom{m}{k}\binom{n}{l}t^k k^{n-l}\varphi_l(t)$ and the corresponding Fubini recurrence, so the paper supplies a unified degenerate interpolation between the two classical formulas.
- Because the right-hand sides involve only polynomials of degree at most $n$ in $t$, the identities give a recursive scheme to compute $\mathrm{Bel}_{n+m,\lambda}$ and $F_{n+m,\lambda}$ from lower indices.
- The same double-sum shape emerges from the two-variable generating function $\sum_{m,n}\mathrm{Bel}_{n+m,\lambda}(t)x^n y^m/(n!m!)$, so the result can be read as a single compact identity for that generating function.
Reading between the lines
- A natural extension the paper does not pursue is to replace $(1)_{k,\lambda}$ by $(a)_{k,\lambda}$ and $e_\lambda$ by a power of itself; exactly the same factorization would likely produce an order-$a$ Spivey-type recurrence for a hierarchy of fully degenerate Bell-type polynomials.
- The proof pattern suggests that any polynomial family whose generating function is a rational or exponential function of $e_\lambda(t)-1$ should admit a Spivey-type recurrence by the same two-step factorization, provided its $y$-dependence enters only through $e_\lambda(y/(1+\lambda x))$; this is an untested extension.
- One could test whether the recurrences admit a combinatorial interpretation in which $(1)_{k,\lambda}\binom{m}{k}_{\lambda}\binom{n}{l}$ weights a choice of $k$ distinguished blocks and $l$ remaining elements in a degenerate set partition, while $F^{(k)}_{n-l,\lambda}(-\lambda t,k-m\lambda)$ counts the rest; the paper gives only an analytic derivation.
Original abstract
Spivey's combinatorial method revealed an important identity for Bell numbers, involving Stirling numbers of the second kind. This paper extends his work by deriving Spivey-type recurrence relations for fully degenerate Bell polynomials and degenerate Fubini polynomials. Our derivation uses degenerate Stirling numbers of the second kind and two-variable degenerate Fubini polynomials of order a.
The compiled record
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
The abstract, sentence by sentence
Spivey's combinatorial method revealed an important identity for Bell numbers, involving Stirling numbers of the second kind. This paper extends his work by deriving Spivey-type recurrence relations for fully degenerate Bell polynomials and degenerate Fubini polynomials. Our derivation uses degenerate Stirling numbers of the second kind and two-variable degenerate Fubini polynomials of order a.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | Spivey's combinatorial method revealed an important identity for Bell numbers, involving Stirling numbers of the second kind. | background 1.00 | 0.03 | 0.03 | asserted 1.00 |
| s1 | This paper extends his work by deriving Spivey-type recurrence relations for fully degenerate Bell polynomials and degenerate Fubini polynomials. | contribution 0.99 | 0.96 | 0.83 | asserted 1.00 |
| s2 | Our derivation uses degenerate Stirling numbers of the second kind and two-variable degenerate Fubini polynomials of order a. | method 0.97 | 0.89 | 0.13 | asserted 0.99 |
What was examined, and what was not
- arXiv listing abstract v1
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
References
Discussion
Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.