The Stirling numbers of type of the second kind count signed set partitions. In this paper we provide new combinatorial and analytical identities regarding these numbers as well as Broder’s -version of these numbers. Among these identities one can find recursions, explicit formulas based on the inclusion-exclusion principle, and also exponential generating functions. These Stirling numbers can be considered as members of a wider family of triangles of numbers that are characterized using results of Comtet and Lancaster. We generalize these theorems, which present equivalent conditions for a triangle of numbers to be a triangle of generalized Stirling numbers, to the case of the -poly Stirling numbers, which are -analogues of the restricted Stirling numbers defined by Broder and having a polynomial value appearing in their defining recursion. There are two ways to do this and these ways are related by a nice identity.

生成讲解博客的中文版本

生成AI智能校验的中文版本