Stirling cycle numbers

SearchAdvancedHelp

(0.001 seconds)

3 matching pages

1: 26.13 Permutations: Cycle Notation

… ►The number of elements of ${𝔖}_n$ with cycle type $\left(a_1,a_2,\mathrm{\dots },a_n\right)$ is given by (26.4.7). ►The Stirling cycle numbers of the first kind, denoted by $\left[\genfrac{}{}{0.0pt}{}{n}{k}\right]$, count the number of permutations of $\{1,2,\mathrm{\dots },n\}$ with exactly $k$ cycles. … ►

26.13.3 $$\left[\genfrac{}{}{0.0pt}{}{n}{k}\right]=\left|s(n,k)\right|.$$

ⓘ

Defines:

$\left[\genfrac{}{}{0.0pt}{}{n}{k}\right]$: Stirling cycle number of the first kind

Symbols:

$s(n,k)$: Stirling number of the first kind, $k$: nonnegative integer and $n$: nonnegative integer

Referenced by:

§4.13

Permalink:

http://dlmf.nist.gov/26.13.E3

Encodings:

pMML, png, TeX

See also:

Annotations for §26.13 and Ch.26

…

2: 4.13 Lambert $W$-Function

… ►For the definition of Stirling cycle numbers of the first kind $\left[\genfrac{}{}{0.0pt}{}{n}{k}\right]$ see (26.13.3). … ►

4.13.10 $$W_k\left(z\right)\sim {\xi }_k-\ln {\xi }_k+\sum _{n=1}^{\mathrm{\infty }}\frac{{(-1)}^n}{{\xi }_k^n}\sum _{m=1}^n\left[\genfrac{}{}{0.0pt}{}{n}{n-m+1}\right]\frac{{\left(-\ln {\xi }_k\right)}^m}{m!},$$

ⓘ

Symbols:

$W\left(z\right)$: Lambert $W$-function, $\left[\genfrac{}{}{0.0pt}{}{n}{k}\right]$: Stirling cycle number of the first kind, $\sim$: Poincaré asymptotic expansion, $!$: factorial (as in $n!$), $\ln z$: principal branch of logarithm function, $k$: integer, $m$: integer, $n$: integer and $z$: complex variable

Notes:

See Corless et al. (1996, p. 350) and Jeffrey et al. (1995, Theorem 2).

Referenced by:

§4.13, §4.13, §4.45(iii), Erratum (V1.1.7) for Expansion

Permalink:

http://dlmf.nist.gov/4.13.E10

Encodings:

pMML, png, TeX

Addition (effective with 1.1.7):

Originally we gave only the first three terms of the infinite series.

See also:

Annotations for §4.13 and Ch.4

… ►

4.13.11 $$W_{\pm 1}\left(x\mp 0\mathrm{i}\right)\sim -\eta -\ln \eta +\sum _{n=1}^{\mathrm{\infty }}\frac{1}{{\eta }^n}\sum _{m=1}^n\left[\genfrac{}{}{0.0pt}{}{n}{n-m+1}\right]\frac{{\left(-\ln \eta \right)}^m}{m!},$$

ⓘ

Symbols:

$W\left(z\right)$: Lambert $W$-function, $\left[\genfrac{}{}{0.0pt}{}{n}{k}\right]$: Stirling cycle number of the first kind, $\sim$: Poincaré asymptotic expansion, $!$: factorial (as in $n!$), $\mathrm{i}$: imaginary unit, $\ln z$: principal branch of logarithm function, $m$: integer, $n$: integer, $x$: real variable and $\eta$

Notes:

See Corless et al. (1996, p. 350).

Referenced by:

§4.13, Erratum (V1.1.2) for Equation (4.13.11), Erratum (V1.1.7) for Expansion

Permalink:

http://dlmf.nist.gov/4.13.E11

Encodings:

pMML, png, TeX

Addition (effective with 1.1.7):

Originally we gave only the first three terms of the infinite series.

See also:

Annotations for §4.13 and Ch.4

…

3: 26.8 Set Partitions: Stirling Numbers

… ► $s(n,k)$ denotes the Stirling number of the first kind: ${(-1)}^{n-k}$ times the number of permutations of $\{1,2,\mathrm{\dots },n\}$ with exactly $k$ cycles. …