Questions tagged [stirling-numbers]

For questions about the two kinds of Stirling numbers and related topics, such as Lah numbers.

There are two kinds of Stirling numbers:

Each sequence satisfies a recurrence:

\begin{align*} {n+1 \brack k} &= n {n \brack k} + {n \brack k-1} \\ {n+1 \brace k} &= k {n \brace k} + {n \brace k-1} \end{align*}

Lah numbers are closely related, being $$L(n,k) = \sum_{j=0}^n {n \brack j}{j \brace k}$$

709 questions
1
vote
1 answer

Stirling numbers of the second kind for small numbers of partition

I try to do part b of the question below in a manner similar to part a, but still get stuck. Any hints? My attempt:
ensbana
  • 2,277
1
vote
2 answers

Conceptual numbers of stirling

I keep reading about stirling numbers, but i cant understand the concept, can someone explain me what is a stirling number of species 1 and 2?
1
vote
2 answers

Why $S(n,k)$ is the coefficient of $x^{n-k}$ in $\prod_{t=0}^{k}(1+tx+t^2x^2+\cdots+t^nx^n)$?

$S(n,k)$ is the Stirling number of the second kind. I think an algebraic proof has something to do with the generating function. But I'm more interested in combinatorial proof. Could you please give a combinatorial proof? Thanks!
0
votes
0 answers

Stirling number of the second kind identities

Assuming I don't know that $S(n,1)=1$ and $S(n,2)=2^{n-1} - 1$, how do I find these numbers? For the first one, the only explanation I can come up with is that a set of n elements can be broken into n partitions that are consisted of one element in…
0
votes
1 answer

How do I get the ratio of stirling numbers?

How do I get the ratio: $\sum_{i=k}^n (-1)^{i+k}\left\{\begin{array}{l} n \\ i \end{array}\right\}\left[\begin{array}{c} i \\ k \end{array}\right]=\delta_{n,k}$ ? We know the ratios $x^{\underline{n}}=\sum_{k=0}^n (-1)^{n+k}\left[\begin{array}{c} n…
gkndy
  • 117
0
votes
1 answer

Sum with Stirling numbers of first kind

I have problems with proving this equation: $$ \sum_{k=0}^n s_1(n,k)\cdot 2^{k} = (n+1)!$$ where $s_1(n,k)$ is the Stirling number of first kind.
Nerwena
  • 117
0
votes
1 answer

inequality for stirling numbers of second kind

How can I show that the following inequality hold: $$ S(n,k-1) \leq {k \choose 2}S(n,k), $$ where $k \leq n$ and $S(n,k)$ is the stirling number of second kind.
wayne
  • 757
0
votes
1 answer

Stirling Numbers of the First Kind and Permutations

How to prove that the number of $[n]$ permutations with $k$ cycles is equal with $|s(n,k)|$?
1
2