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
7
votes
2 answers

An identity on Stirling number of the first and the second kind.

I have a difficulty in proving the identity $\sum_{i=k}^n S(n+1,i+1)s(i,k) = \binom{n}{k}$ where $s(n,k)$ is the stirling number of the first kind and $S(n,k)$ is the stirling number of the second kind. I tried to show this equality by arguing a…
3
votes
2 answers

Euler numbers in terms of second kind Stirling numbers and in terms of the Touchard polynomials

I recently managed to prove these equalities: $$E_n=\sum_{k=0}^{n}S(n,k)\frac{-k!\sqrt{2}}{\sqrt{2}^{k}}\cos(\frac{3\pi}{4}(k+1))$$ $$E_n=2\int_{0}^{\infty}e^{-t}\cos(t)T_n(-t)dt$$ where $E_n$ are the Euler number, $S(n,k)$ the Stirling numbers of…
3
votes
1 answer

I just don't see what I do wrong - number of surjections seems higher than number of functions.

EDIT: Answer added. I haven't slept much lately and I've been raging on this thing for a couple hours now. I really hope some people here can have the same obsession/rage and will help me out. I have two sets, A and B. |A| = m, |B| = n. I was…
3
votes
2 answers

A Stirling number identity

Let $s(n,j)$ denote the signed Stirling numbers of the first kind and $S(n,j)$ the Stirling numbers of the second kind. I need the following (probably trivial) identity $\sum\limits_{j = 0}^n {s(n,j)S(m + j,k)} = 0$ for $k < n$ and $\sum\limits_{j…
Johann Cigler
  • 1,299
  • 7
  • 12
3
votes
1 answer

about formulas and identies for Stirling numbers of the second kind

How the two following formulas can be proved (algebraically preferred)? $$\sum_{n=k}^{∞}S\left(n,k\right)\ \frac{x^{n}}{n!}=\frac{1}{k!}\left(e^{x}-1\right)^{k}$$ $$x^{n}=\sum_{m=0}^{n}S\left(n,m\right)\left(x\right)_{m}$$ where $S\left(n,m\right)$…
Absurd
  • 369
  • 1
  • 14
2
votes
1 answer

Stirling numbers of first kind over multiset

Given a multiset $M = \{ 1^{a_1} , 2^{a_2} ,\ldots , k^{a_k} \}$ where $N = \sum_j a_j$ $f(M, r)$ denotes the number of permutations of the multiset $M$ that have exactly $r$ strongly outstanding elements $$ f(M, r) = (\binom{N}{a_1} - \binom{N -…
user92
  • 21
2
votes
2 answers

Why is $S_{n,3} = \frac{1}{6}(3^n - 3\cdot2^n+3)$? (Stirling)

Why is $S_{n,3} = \frac{1}{6}(3^n - 3\cdot2^n+3)$? I know that $S(n,3)=3S(n-1,3)+S(n-1,2)$ Where we know $S(n,2)=2S(n-1,2)+1$ We can also see the latter recurrence leads to $S(n,2)=2^{n-1}-1$ So we get $S(n,2)=2s(n-1,2)+2^{n-1}-1$ I am new to…
user616397
2
votes
2 answers

Proving $S(n,n-2) = \frac{n(n-1)(n-2)(3n-5)}{24}.$

I have to prove $$S(n,n-2) = \frac{n(n-1)(n-2)(3n-5)}{24},$$ for Stirling numbers of the second kind. I want to show it via induction on $n$ as he did on this problem: Induction with Stirling numbers of the second kind (3 "bins") Recursion for…
2
votes
1 answer

Stirling numbers of first kind

Let $\sigma=\sigma_1 \sigma_2 \cdot \cdot \cdot \sigma_n \in S_n$ which means a permutation of the elements $1,2,...,n$. $\sigma_j$ is called a left-right maximum of $ \sigma$ if $\sigma_k <\sigma_j$ for all $k
Mathfreak
  • 257
2
votes
1 answer

Example of Stirling Numbers of the First Kind

I am trying to calculate the stirling numbers of the first kind. I am not very good in math and there is not a single example somewhere in the internet. So I would really appreciate it if you could help me there. The stirling number which I want to…
2
votes
1 answer

What is the generating function for $c(n,k)$?

I was reading "The Introduction to Combinatorial Analysis" by John Riordan. Let $c(n,k)$ denote the signless Stirling number of the first kind. He asks, how many permutations there are with $k$ cycles, regardless of lengths, and then gives (link to…
1
vote
1 answer

Proof for identity for bell numbers

How can I proof this identity for bell numbers? $$B_n = \sum_{k=0}^n S(n,k)$$ Is it possible without using the recurrence relation?
1
vote
1 answer
1
vote
0 answers

Number of integer sequences with specific conditions proof

I'm trying to prove that the number of integer sequences of length $n$: $(a_1, a_2, \ldots, a_n)$ such that $0 \leq a_i \leq (n-i)$, $1 \leq i \leq n$ and exactly $k$ entries are equal to $0$ is given by the Stirling number of the first kind i. e.…
1
vote
1 answer

How to prove the relationship between Stirling numbers first kind and second kind with negative integral values

I am studying Stirling Numbers recently based on the wikipedia information and I am currently stuck on how to prove this relationship between Stirling Number first kind and second kind with negative value.Based on the table, it is easy to see. But…
Sean
  • 41
1
2