Stirling Numbers and Generalized Zagreb Indices

Generalized Stirling and Lah numbers

The theory of modular binomial lattices enables the simultaneous combinatorial analysis of finite sets, vector spaces, and chains. Within this theory three generalizations of Stifling numbers of the second kind, and of Lah numbers, are developed. 1. Stirling numbers and their formal generalizations The nota t ional convent ions of this paper are as follows: N = {0,1,2 . . . . }, P = {1,2,. . . ...

Generalized higher order Stirling numbers

Combinatorially interpreting generalized Stirling numbers

The Stirling numbers of the second kind { n k } (counting the number of partitions of a set of size n into k non-empty classes) satisfy the relation

The Generalized Stirling and Bell Numbers Revisited

The generalized Stirling numbers Ss;h(n, k) introduced recently by the authors are shown to be a special case of the three parameter family of generalized Stirling numbers S(n, k;α, β, r) considered by Hsu and Shiue. From this relation, several properties of Ss;h(n, k) and the associated Bell numbers Bs;h(n) and Bell polynomials Bs;h|n(x) are derived. The particular case s = 2 and h = −1 corres...

On Generalized Stirling Numbers and Polynomials

In this paper we prove that some results concerned the generalized Stirling numbers are the consequence of the results of Toscano and Chak. The new explicit expressions for generalized Stirling numbers are also given.

Combinatorial Interpretation of Generalized Stirling Numbers

A combinatorial interpretation of the earlier studied generalized Stirling numbers, emerging in a normal ordering problem and its inversion, is given. It involves unordered forests of certain types of labeled trees. Partition number arrays related to such forests are also presented.