✦ LIBER ✦

A generalization of the Stirling numbers

✍ Scribed by Daniel E. Loeb

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 575 KB
Volume: 103
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90318-a

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counting Pattern-free Set Partitions I:

Counting Pattern-free Set Partitions I: A Generalization of Stirling Numbers of the Second Kind

✍ Martin Klazar 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 160 KB

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

A probabilistically attained set of poly

A probabilistically attained set of polynomials that generate stirling numbers of the second kind

✍ Arthur J. Roth; Milton Sobel 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 734 KB

Using probabilistic arguments, we derive a sequence of polynomials in one variable which generate the Stirling numbers of the second kind. Specifically where S: is the desired Stirling number and P,\_,,,(\*> is the polynomial of degree c -m.

The Group of Generalized Stirling Number

The Group of Generalized Stirling Numbers

✍ Thomas Bickel 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 140 KB

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

Generalized Stirling and Lah numbers

✍ Carl G. Wagner 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 836 KB

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.

A Unified Approach to Generalized Stirli

A Unified Approach to Generalized Stirling Numbers

✍ Leetsch C. Hsu; Peter Jau-Shyong Shiue 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 191 KB

It is shown that various well-known generalizations of Stirling numbers of the first and second kinds can be unified by starting with transformations between generalized factorials involving three arbitrary parameters. Previous extensions of Stirling numbers due to Riordan, Carlitz, Howard, Charalam

The r-Stirling numbers

✍ Andrei Z Broder 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 617 KB

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