Search arXivSearch

arXiv · 2511.12433

A Generalized Recurrence for fully degenerate Bell polynomials

Abstract

This paper addresses the unnatural appearance of the two-variable degenerate Fubini polynomials in a recently derived Spivey-type recurrence relation for the fully degenerate Bell polynomials. To solve this, we introduce a new family of polynomial which we also call the fully degenerate Bell polynomials, along with their two-variable counterparts. Our main contribution is the derivation of natural Spivey-type recurrence relations using operator methods. We extend these results to the r-counterparts, the fully degenerate r-Bell polynomials providing Dobinski-like, finite sum, operator expressions, and Spivey-type recurrence relations for all the new polynomials.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Taekyun Kim, Dae San Kim. 2025-11-16. A Generalized Recurrence for fully degenerate Bell polynomials. https://arxiv.org/abs/2511.12433

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO