The finitude of the fibers of the complementary Bell numbers

Abstract

Subbarao and Verma introduced, in 1999, a number of open problems concerning the sequence $(f(n))_{n \geq 0}$ of complementary Bell numbers, which may be defined via Bell polynomials $B_{n}(x) = \sum_{k=0}^{n} \left\{ \begin{smallmatrix} n \\ k \end{smallmatrix} \right\} x^k$ so that $f(n) = B_{n}(-1)$. Yang [Electron. J. Combin., 2001] subsequently solved the first two problems from Subbarao and Verma, but the third such problem has remained open, to the best of our knowledge. The first part of this third problem asks whether or not $f(n)$ takes any given value only a finite number of times. We solve this problem in the affirmative, through a combined application of finite difference-based methods, partial Motzkin paths, the completeness of the Tate algebra with respect to the Gauss norm, and Strassmann's theorem.

Disclosure

“) that the sequence of absolute values of complementary Bell numbers tends to infinity. Acknowledgements. The author acknowledges extensive interactions with GPT-5.6 Pro during the exploratory and proof-development stages of this work. All AI-generated suggestions were substantially revised, corrected, and independently verified by the author, who assumes full responsibility for the mathematical content. References [1] Tewodros Amdeberhan, Valerio De”

PDF page 11

Classification

Proof ideas or individual proof-step assistance

Multiplier

8

Verified

2026-08-23T19:16:32.365081Z

Structural counts