List questions from stirling-numbers

Published on 28 Jun 2021 - 22:10

127

Views

Stirling number of the second kind identities

Published on 30 Jun 2021 - 9:37

142

Views

Summation of product of combination and Stirling numbers

Published on 06 Jul 2021 - 16:57

65

Views

A polynomial rep. for $\frac{1}{m!} \sum_{k=0}^n (-1)^{k+m} \frac{k^n}{k+1} \binom{m}{k}$

Published on 27 Mar 2026 - 23:31

101

Views

Connecting Euler Numbers of the Second Kind and Unsigned Stirling Numbers of the First Kind.

Published on 23 Feb 2026 - 8:40

62

Views

Counting trivial cases of combinatorial functions

Published on 21 Jul 2021 - 6:45

53

Views

Summation ofProduct of r-Stirling numbers of the second kind

Published on 23 Jul 2021 - 7:45

228

Views

Expected number of cycles in random permutations

Published on 31 Jul 2021 - 9:14

197

Views

Ordinary Generating Function For the Unsigned Stirling numbers of the First Kind

Published on 05 Aug 2021 - 6:16

1.1k

Views

Discrete mathematics - ternary strings.

Published on 28 Mar 2026 - 1:26

178

Views

What's a formal definition of cycles that will allow me to prove this identity?

Published on 27 Mar 2026 - 22:57

317

Views

Combinatorial arguments for two stirling numbers

Published on 18 Aug 2021 - 5:46

63

Views

Can I make this combinatorial proof work?

Published on 24 Aug 2021 - 21:39

118

Views

Why is the following not $S(n,3)$ where $S(n,k)$ is a Stirling number of the second kind? (almost solved)

Published on 29 Mar 2026 - 14:25

176

Views

Approximation of Stirling numbers of the second kind ${2n \brace n}$

Published on 01 Sep 2021 - 11:31

List Question

Proof for Stirling numbers when p is prime

Stirling number of the second kind identities

Summation of product of combination and Stirling numbers

A polynomial rep. for $\frac{1}{m!} \sum_{k=0}^n (-1)^{k+m} \frac{k^n}{k+1} \binom{m}{k}$

Connecting Euler Numbers of the Second Kind and Unsigned Stirling Numbers of the First Kind.

Counting trivial cases of combinatorial functions

Summation ofProduct of r-Stirling numbers of the second kind

Expected number of cycles in random permutations

Ordinary Generating Function For the Unsigned Stirling numbers of the First Kind

Discrete mathematics - ternary strings.

What's a formal definition of cycles that will allow me to prove this identity?

Combinatorial arguments for two stirling numbers

Can I make this combinatorial proof work?

Why is the following not $S(n,3)$ where $S(n,k)$ is a Stirling number of the second kind? (almost solved)

Approximation of Stirling numbers of the second kind ${2n \brace n}$

Trending Questions

Popular # Hahtags

Popular Questions