Computing a family of probabilistic numbers in terms of probabilistic Stirling numbers of the second kind.

Saved in:
Bibliographic Details
Title: Computing a family of probabilistic numbers in terms of probabilistic Stirling numbers of the second kind.
Authors: Xu, Aimin1 (AUTHOR) xuaimin1009@hotmail.com
Source: Applied Mathematics in Science & Engineering. Dec2025, Vol. 33 Issue 1, p1-17. 17p.
Subjects: Probabilistic number theory, Bernoulli numbers, Lagrange problem, Euler's numbers, Combinatorics
Abstract: In this paper, we introduce the probabilistic Bernoulli numbers, Cauchy numbers, and Euler numbers of order α associated with the random variable Y, utilizing the generating function approach. Meanwhile, by employing important tools from combinatorial analysis, such as the partial Bell polynomials and the Lagrange inversion formula, we provide computational formulas for these numbers in terms of the probabilistic Stirling numbers of the second kind. Furthermore, we introduce the probabilistic Stirling numbers of the first kind, and derive a computational formula in terms of the probabilistic Stirling numbers of the second kind, which can be seen as a probabilistic version of the Schlömilch formula. [ABSTRACT FROM AUTHOR]
Copyright of Applied Mathematics in Science & Engineering is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
Description
Abstract:In this paper, we introduce the probabilistic Bernoulli numbers, Cauchy numbers, and Euler numbers of order α associated with the random variable Y, utilizing the generating function approach. Meanwhile, by employing important tools from combinatorial analysis, such as the partial Bell polynomials and the Lagrange inversion formula, we provide computational formulas for these numbers in terms of the probabilistic Stirling numbers of the second kind. Furthermore, we introduce the probabilistic Stirling numbers of the first kind, and derive a computational formula in terms of the probabilistic Stirling numbers of the second kind, which can be seen as a probabilistic version of the Schlömilch formula. [ABSTRACT FROM AUTHOR]
ISSN:27690911
DOI:10.1080/27690911.2025.2485250