The r-Stifling numbers of the first and second kind count restricted permutations and respectively restricted partitions, the restriction being that the first r elements must be in distinct cycles and respectively distinct subsets. The combinatorial and algebraic properties of these numbers, which i
Degenerate weighted Stirling numbers
โ Scribed by F.T Howard
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 631 KB
- Volume
- 57
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
โฆ Synopsis
We define the degenerate weighted Stifling numbers of the first and second kinds, Sl(n, k, 2t ] 0) and S(n, k, )t ] O). By specializing h and 0 we can obtain the Stirling numbers, the weighted Stifling numbers and the degenerate Stifling numbers. Basic properties of Sl(n, k, h { 0) and S(n, k, ;t I 0), such as recurrence formulas and combinatorial interpretations, are presented, and a theorem which relates Sx(n, k, )t I O) and S(n, k, h I O) to each other, and to other special numbers, is proved. This theorem provides a unified approach to a number of special cases which have recently appeared in the literature.
๐ SIMILAR VOLUMES
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.
In this paper we provide an algebraic approach to the generalized Stirling numbers (GSN). By defining a group that contains the GSN, we obtain a unified interpretation for important combinatorial functions like the binomials, Stirling numbers, Gaussian polynomials. In particular we show that many GS
In this paper we prove some identities involving Bernoulli and Stirling numbers, relation for two or three consecutive Bernoulli numbers, and various representations of Bernoulli numbers.