👉1(716)351-621📞Delta Flights 🪐stirlingses 🛸picker Change honneur 🌍Number

SearchAdvancedHelp

The term"bigdelta" was not found.Possible alternative term: "bigeta".

(0.003 seconds)

1—10 of 845 matching pages

1: Bibliography J

… ►

Fonctions de Mathieu et polynômes de Klein-Gordon. C. R. Acad. Sci. Paris Sér. I Math. 325 (7), pp. 713–716 (French).

ⓘ

Notes:

Translated title: Mathieu functions and Klein-Gordon polynomials.

External Links:

ISSN 0764-4442, Document, MathReview, ZentralBlatt

Referenced by:

7th item.

Encodings:

BibTeX

… ►

Density matrix of an impenetrable Bose gas and the fifth Painlevé transcendent. Phys. D 1 (1), pp. 80–158.

ⓘ

External Links:

ISSN 0167-2789, Document, MathReview, ZentralBlatt

Referenced by:

§32.16.

Encodings:

BibTeX

… ►

Uniform asymptotic expansions for Meixner polynomials. Constr. Approx. 14 (1), pp. 113–150.

ⓘ

External Links:

ISSN 0176-4276, Document, MathReview (Richard B. Paris), ZentralBlatt

Referenced by:

§18.24, §2.4(vi).

Encodings:

BibTeX

… ►

Note sur la série ${\sum }_{n=1}^{\mathrm{\infty }}{x}^n/n^s$ . Bull. Soc. Math. France 17, pp. 142–152 (French).

ⓘ

External Links:

ISSN 0037-9484, MathReview Entry, ZentralBlatt

Referenced by:

§25.12(ii).

Encodings:

BibTeX

… ►

Memoire sur l’itération des fonctions rationnelles. J. Math. Pures Appl. 8 (1), pp. 47–245 (French).

ⓘ

External Links:

FullText, ZentralBlatt

Referenced by:

§3.8(viii).

Encodings:

BibTeX

2: 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). …

3: Bibliography D

… ►

Quantum Fields and Strings: A Course for Mathematicians. Vol. 1, 2. American Mathematical Society, Providence, RI.

ⓘ

Notes:

Material from the Special Year on Quantum Field Theory held at the Institute for Advanced Study, Princeton, NJ, 1996–1997

External Links:

ISBN 0-8218-1198-3, MathReview, ZentralBlatt

Referenced by:

§21.9.

Encodings:

BibTeX

… ►

Irreducibility of certain generalized Bernoulli polynomials belonging to quadratic residue class characters. J. Number Theory 25 (1), pp. 72–80.

ⓘ

External Links:

ISSN 0022-314X, Document, MathReview (T. Metsänkylä)

Referenced by:

§24.12(iii).

Encodings:

BibTeX

… ►

Sums of products of Bernoulli numbers. J. Number Theory 60 (1), pp. 23–41.

ⓘ

External Links:

ISSN 0022-314X, Document, MathReview (Wen Peng Zhang), ZentralBlatt

Referenced by:

§24.14(ii).

Encodings:

BibTeX

… ►

The Bose-Einstein integrals ${ℬ}_p(\eta )={(p!)}^{-1}{\int }_0^{\mathrm{\infty }}{ϵ}^p{(e^{ϵ-\eta }-1)}^{-1}𝑑ϵ$ . Appl. Sci. Res. B. 6, pp. 240–244.

ⓘ

External Links:

ISSN 0003-6994, MathReview Entry, ZentralBlatt

Referenced by:

(25.12.15), §25.12(iii), §25.12.

Encodings:

BibTeX

►

The Fermi-Dirac integrals ${ℱ}_p(\eta )={(p!)}^{-1}{\int }_0^{\mathrm{\infty }}{ϵ}^p{(e^{ϵ-\eta }+1)}^{-1}𝑑ϵ$ . Appl. Sci. Res. B. 6, pp. 225–239.

ⓘ

External Links:

ISSN 0003-6994, MathReview Entry, ZentralBlatt

Referenced by:

(25.12.14), §25.12(iii), §25.12.

Encodings:

BibTeX

…

4: 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. … ► $S(n,k)$ denotes the Stirling number of the second kind: the number of partitions of $\{1,2,\mathrm{\dots },n\}$ into exactly $k$ nonempty subsets. … ►where ${\left(x\right)}_n$ is the Pochhammer symbol: $x(x+1)\mathrm{\cdots }(x+n-1)$. … ►For $n\ge 1$, … ►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: 26.1 Special Notation

… ► ►►►

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

… ►

$$x^{\overline{n}}=x(x+1)(x+2)\mathrm{\cdots }(x+n-1),$$

►

$$x^{\underset{¯}{n}}=x(x-1)(x-2)\mathrm{\cdots }(x-n+1).$$

►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).

6: 26.4 Lattice Paths: Multinomial Coefficients and Set Partitions

… ► $\left(\genfrac{}{}{0.0pt}{}{n}{n_1,n_2,\mathrm{\dots },n_k}\right)$ is the number of ways of placing $n=n_1+n_2+\mathrm{\cdots }+n_k$ distinct objects into $k$ labeled boxes so that there are $n_j$ objects in the $j$th box. It is also the number of $k$-dimensional lattice paths from $(0,0,\mathrm{\dots },0)$ to $(n_1,n_2,\mathrm{\dots },n_k)$. For $k=0,1$, the multinomial coefficient is defined to be $1$. … ► $M_2$ is the number of permutations of $\{1,2,\mathrm{\dots },n\}$ with $a_1$ cycles of length 1, $a_2$ cycles of length 2, $\mathrm{\dots }$, and $a_n$ cycles of length $n$: …$M_3$ is the number of set partitions of $\{1,2,\mathrm{\dots },n\}$ with $a_1$ subsets of size 1, $a_2$ subsets of size 2, $\mathrm{\dots }$, and $a_n$ subsets of size $n$: …

7: 24.20 Tables

§24.20 Tables

►Abramowitz and Stegun (1964, Chapter 23) includes exact values of ${\sum }_{k=1}^m{k}^n$, $m=1(1)100$, $n=1(1)10$; ${\sum }_{k=1}^{\mathrm{\infty }}{k}^{-n}$, ${\sum }_{k=1}^{\mathrm{\infty }}{(-1)}^{k-1}{k}^{-n}$, ${\sum }_{k=0}^{\mathrm{\infty }}{(2k+1)}^{-n}$, $n=1,2,\mathrm{\dots }$, 20D; ${\sum }_{k=0}^{\mathrm{\infty }}{(-1)}^k{(2k+1)}^{-n}$, $n=1,2,\mathrm{\dots }$, 18D. ►Wagstaff (1978) gives complete prime factorizations of $N_n$ and $E_n$ for $n=20(2)60$ and $n=8(2)42$, respectively. … ►For information on tables published before 1961 see Fletcher et al. (1962, v. 1, §4) and Lebedev and Fedorova (1960, Chapters 11 and 14).

8: 22.7 Landen Transformations

… ►

22.7.1 $$k_1=\frac{1-k^{\prime }}{1+k^{\prime }},$$

ⓘ

Defines:

$k_1$: change of variable (locally)

Symbols:

$k^{\prime }$: complementary modulus

A&S Ref:

16.12.1

Referenced by:

§22.20(iii)

Permalink:

http://dlmf.nist.gov/22.7.E1

Encodings:

pMML, png, TeX

See also:

Annotations for §22.7(i), §22.7 and Ch.22

►

22.7.2 $$\mathrm{sn}(z,k)=\frac{(1+k_1)\mathrm{sn}(z/(1+k_1),k_1)}{1+k_1{\mathrm{sn}}^2(z/(1+k_1),k_1)},$$

ⓘ

Symbols:

$\mathrm{sn}(z,k)$: Jacobian elliptic function, $z$: complex, $k$: modulus and $k_1$: change of variable

A&S Ref:

16.12.2

Referenced by:

§22.20(iii)

Permalink:

http://dlmf.nist.gov/22.7.E2

Encodings:

pMML, png, TeX

See also:

Annotations for §22.7(i), §22.7 and Ch.22

►

22.7.3 $$\mathrm{cn}(z,k)=\frac{\mathrm{cn}(z/(1+k_1),k_1)\mathrm{dn}(z/(1+k_1),k_1)}{1+k_1{\mathrm{sn}}^2(z/(1+k_1),k_1)},$$

ⓘ

Symbols:

$\mathrm{cn}(z,k)$: Jacobian elliptic function, $\mathrm{dn}(z,k)$: Jacobian elliptic function, $\mathrm{sn}(z,k)$: Jacobian elliptic function, $z$: complex, $k$: modulus and $k_1$: change of variable

A&S Ref:

16.12.3

Referenced by:

§22.20(iii)

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §22.7(i), §22.7 and Ch.22

►

22.7.4 $$\mathrm{dn}(z,k)=\frac{{\mathrm{dn}}^2(z/(1+k_1),k_1)-(1-k_1)}{1+k_1-{\mathrm{dn}}^2(z/(1+k_1),k_1)}.$$

ⓘ

Symbols:

$\mathrm{dn}(z,k)$: Jacobian elliptic function, $z$: complex, $k$: modulus and $k_1$: change of variable

A&S Ref:

16.12.4

Referenced by:

§22.20(iii)

Permalink:

http://dlmf.nist.gov/22.7.E4

Encodings:

pMML, png, TeX

See also:

Annotations for §22.7(i), §22.7 and Ch.22

… ►

$k_2^{\prime }={\displaystyle \frac{1-k}{1+k}},$

…

9: 26.13 Permutations: Cycle Notation

… ► ${𝔖}_n$ denotes the set of permutations of $\{1,2,\mathrm{\dots },n\}$. … ►is $\left(1,3,2,5,7\right)\left(4\right)\left(6,8\right)$ in cycle notation. …In consequence, (26.13.2) can also be written as $\left(1,3,2,5,7\right)\left(6,8\right)$. … ►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. …

10: 26.3 Lattice Paths: Binomial Coefficients

… ► $\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$ is the number of ways of choosing $n$ objects from a collection of $m$ distinct objects without regard to order. $\left(\genfrac{}{}{0.0pt}{}{m+n}{n}\right)$ is the number of lattice paths from $(0,0)$ to $(m,n)$. …The number of lattice paths from $(0,0)$ to $(m,n)$, $m\le n$, that stay on or above the line $y=x$ is $\left(\genfrac{}{}{0.0pt}{}{m+n}{m}\right)-\left(\genfrac{}{}{0.0pt}{}{m+n}{m-1}\right).$ … ►

26.3.4 $$\sum _{m=0}^{\mathrm{\infty }}\left(\genfrac{}{}{0.0pt}{}{m+n}{m}\right)x^m=\frac{1}{{(1-x)}^{n+1}},$$ .

ⓘ

Symbols:

$\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$: binomial coefficient, $x$: real variable, $m$: nonnegative integer and $n$: nonnegative integer

A&S Ref:

24.1.1 (in slightly different form)

Permalink:

http://dlmf.nist.gov/26.3.E4

Encodings:

pMML, png, TeX

See also:

Annotations for §26.3(ii), §26.3 and Ch.26

… ►

26.3.6 $$\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)=\frac{m}{n}\left(\genfrac{}{}{0.0pt}{}{m-1}{n-1}\right)=\frac{m-n+1}{n}\left(\genfrac{}{}{0.0pt}{}{m}{n-1}\right),$$ $m\ge n\ge 1$,

ⓘ

Symbols:

$\left(\genfrac{}{}{0.0pt}{}{m}{n}\right)$: binomial coefficient, $m$: nonnegative integer and $n$: nonnegative integer

Permalink:

http://dlmf.nist.gov/26.3.E6

Encodings:

pMML, png, TeX

See also:

Annotations for §26.3(iii), §26.3 and Ch.26

…