Emirates stirlingses Reservation Number 83267

SearchAdvancedHelp

(0.003 seconds)

1—10 of 226 matching pages

1: 24.1 Special Notation

… ►

Bernoulli Numbers and Polynomials

►The origin of the notation $B_n$, $B_n\left(x\right)$, is not clear. … ►

Euler Numbers and Polynomials

… ►Its coefficients were first studied in Euler (1755); they were called Euler numbers by Raabe in 1851. The notations $E_n$, $E_n\left(x\right)$, as defined in §24.2(ii), were used in Lucas (1891) and Nörlund (1924). …

2: Peter L. Walker

… ►was Professor of Mathematics at the American University of Sharjah, Sharjah, United Arab Emirates, in 1997–2005. … ►Walker’s published work has been mainly in real and complex analysis, with excursions into analytic number theory and geometry, the latter in collaboration with Professor Mowaffaq Hajja of the University of Jordan. …

3: 20 Theta Functions

…

4: 26.8 Set Partitions: Stirling Numbers

§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. … … ►Let $A$ and $B$ be the $n\times n$ matrices with $(j,k)$th elements $s(j,k)$, and $S(j,k)$, respectively. … ►For asymptotic approximations for $s(n+1,k+1)$ and $S(n,k)$ that apply uniformly for $1\le k\le n$ as $n\to \mathrm{\infty }$ see Temme (1993) and Temme (2015, Chapter 34). …

5: 22 Jacobian Elliptic Functions

…

6: 23 Weierstrass Elliptic and Modular
Functions

…

7: 26.1 Special Notation

… ► ►►►►►

$\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$	binomial coefficient.
…
$B\left(n\right)$	Bell number.
$C\left(n\right)$	Catalan number.
…
$s(n,k)$	Stirling numbers of the first kind.
…

… ►Other notations for $s(n,k)$, the Stirling numbers of the first kind, include $S_n^{(k)}$ (Abramowitz and Stegun (1964, Chapter 24), Fort (1948)), $S_n^k$ (Jordan (1939), Moser and Wyman (1958a)), $\left(\genfrac{}{}{0.0pt}{}{n-1}{k-1}\right)B_{n-k}^{(n)}$ (Milne-Thomson (1933)), ${(-1)}^{n-k}{S}_1(n-1,n-k)$ (Carlitz (1960), Gould (1960)), ${(-1)}^{n-k}\left[\genfrac{}{}{0pt}{}{n}{k}\right]$ (Knuth (1992), Graham et al. (1994), Rosen et al. (2000)). ►Other notations for $S(n,k)$, the Stirling numbers of the second kind, include ${𝒮}_n^{(k)}$ (Fort (1948)), ${𝔖}_n^k$ (Jordan (1939)), ${\sigma }_n^k$ (Moser and Wyman (1958b)), $\left(\genfrac{}{}{0.0pt}{}{n}{k}\right)B_{n-k}^{(-k)}$ (Milne-Thomson (1933)), $S_2(k,n-k)$ (Carlitz (1960), Gould (1960)), $\left\{\genfrac{}{}{0pt}{}{n}{k}\right\}$ (Knuth (1992), Graham et al. (1994), Rosen et al. (2000)), and also an unconventional symbol in Abramowitz and Stegun (1964, Chapter 24).

8: 26.21 Tables

§26.21 Tables

►Abramowitz and Stegun (1964, Chapter 24) tabulates binomial coefficients $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$ for $m$ up to 50 and $n$ up to 25; extends Table 26.4.1 to $n=10$; tabulates Stirling numbers of the first and second kinds, $s(n,k)$ and $S(n,k)$, for $n$ up to 25 and $k$ up to $n$; tabulates partitions $p\left(n\right)$ and partitions into distinct parts $p(𝒟,n)$ for $n$ up to 500. ►Andrews (1976) contains tables of the number of unrestricted partitions, partitions into odd parts, partitions into parts $\cancel{\equiv }\pm 2(mod5)$, partitions into parts $\cancel{\equiv }\pm 1(mod5)$, and unrestricted plane partitions up to 100. It also contains a table of Gaussian polynomials up to ${\left[\genfrac{}{}{0.0pt}{}{12}{6}\right]}_q$. ►Goldberg et al. (1976) contains tables of binomial coefficients to $n=100$ and Stirling numbers to $n=40$.

9: 24.15 Related Sequences of Numbers

… ►

§24.15(i) Genocchi Numbers

… ►

§24.15(ii) Tangent Numbers

… ►

§24.15(iii) Stirling Numbers

►The Stirling numbers of the first kind $s(n,m)$, and the second kind $S(n,m)$, are as defined in §26.8(i). … ►

§24.15(iv) Fibonacci and Lucas Numbers

…

10: 26.13 Permutations: Cycle Notation

… ►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. They are related to Stirling numbers of the first kind by …See §26.8 for generating functions, recurrence relations, identities, and asymptotic approximations. … ►The derangement number, $d(n)$, is the number of elements of ${𝔖}_n$ with no fixed points: … ►A permutation is even or odd according to the parity of the number of transpositions. …