A partition u of [k] = {1, 2, . . . , k} is contained in another partition v of [l] if [l] has a k-subset on which v induces u. We are interested in counting partitions v not containing a given partition u or a given set of partitions R. This concept is related to that of forbidden permutations. A s
Refined Stirling Numbers: Enumeration of Special Sets of Permutations and Set-Partitions
β Scribed by J. Katriel
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 110 KB
- Volume
- 99
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
β¦ Synopsis
The refined Stirling numbers of the first kind
specify the number of permutations of n indices possessing m i cycles whose lengths modulo k are congruent to i; i ΒΌ 0; 1; 2; . . . ; k Γ 1: The refined Stirling numbers of the second kind
are similarly defined in terms of set-partitions and the cardinalities of their disjoint blocks. Generating functions for these two types of refined Stirling numbers are derived using the Fa" a a di Bruno formula. These generating functions allow the derivation of recurrence relations for both types of refined Stirling numbers. # 2002
Elsevier Science (USA)
π SIMILAR VOLUMES
This is the second volume of a proposed three-volume atlas of the human body. Volume I comprises illustrations of the bones, joints and mnscles. Volume I11 will deal with the peripheral nerves and blood vessels and with regional anatomy. Volnnie I1 contains 145