relation%20to%20polylogarithms

SearchAdvancedHelp

(0.003 seconds)

11—20 of 899 matching pages

11: 20 Theta Functions

Chapter 20 Theta Functions

…

12: Bibliography V

… ►

An integral transform involving Heun functions and a related eigenvalue problem. SIAM J. Math. Anal. 17 (3), pp. 688–703.

ⓘ

External Links:

ISSN 0036-1410, Document, MathReview (William L. Perry), ZentralBlatt

Referenced by:

§31.10(i).

Encodings:

BibTeX

►

Airy Functions and Applications to Physics. Second edition, Imperial College Press, London.

ⓘ

External Links:

ISBN 978-1-84816-548-9; 1-84816-548-X, MathReview Entry, ZentralBlatt

Referenced by:

§1.17(ii), §9.10(ii), §9.10(ix), §9.11(v), §9.16, §9.16, §9.5(i).

Encodings:

BibTeX

… ►

Some Wonderful Formulas $\mathrm{\dots }$ an Introduction to Polylogarithms. In Proceedings of the Queen’s Number Theory Conference, 1979 (Kingston, Ont., 1979), R. Ribenboim (Ed.), Queen’s Papers in Pure and Appl. Math., Vol. 54, Kingston, Ont., pp. 269–286.

ⓘ

External Links:

MathReview (F. Beukers), ZentralBlatt

Referenced by:

(25.6.10), (25.6.8), (25.6.9), §25.6(i), §25.6.

Encodings:

BibTeX

… ►

Integral relations for Lamé functions. SIAM J. Math. Anal. 13 (6), pp. 978–987.

ⓘ

External Links:

ISSN 0036-1410, Document, MathReview (F. M. Arscott), ZentralBlatt

Referenced by:

§29.8, §29.8.

Encodings:

BibTeX

… ►

Error estimates for Rayleigh-Ritz approximations of eigenvalues and eigenfunctions of the Mathieu and spheroidal wave equation. Constr. Approx. 20 (1), pp. 39–54.

ⓘ

External Links:

ISSN 0176-4276, Document, MathReview, ZentralBlatt

Referenced by:

§30.16(i), §30.16(ii), §30.16(ii).

Encodings:

BibTeX

…

13: 26.3 Lattice Paths: Binomial Coefficients

… ►

§26.3(i) Definitions

► $\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(iii) Recurrence Relations

…

14: Tom M. Apostol

… ►Apostol was born on August 20, 1923. … ►He was also a coauthor of three textbooks written to accompany the physics telecourse The Mechanical Universe …and Beyond. … ►In 1998, the Mathematical Association of America (MAA) awarded him the annual Trevor Evans Award, presented to authors of an exceptional article that is accessible to undergraduates, for his piece entitled “What Is the Most Surprising Result in Mathematics?” (Answer: the prime number theorem). … Ford Award, given to recognize authors of articles of expository excellence. … ►

25 Zeta and Related Functions

…

15: 26.5 Lattice Paths: Catalan Numbers

… ►

§26.5(i) Definitions

… ►It counts the number of lattice paths from $(0,0)$ to $(n,n)$ that stay on or above the line $y=x$. … ►

§26.5(iii) Recurrence Relations

… ►

26.5.6 $$C\left(n\right)\sim \frac{4^n}{\sqrt{\pi n^3}},$$ $n\to \mathrm{\infty }$,

ⓘ

Symbols:

$C\left(n\right)$: Catalan number, $\sim$: asymptotic equality, $\pi$: the ratio of the circumference of a circle to its diameter and $n$: nonnegative integer

Permalink:

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

Encodings:

pMML, png, TeX

See also:

Annotations for §26.5(iv), §26.5 and Ch.26

►

26.5.7 $$\underset{n\to \mathrm{\infty }}{lim}\frac{C\left(n+1\right)}{C\left(n\right)}=4.$$

ⓘ

Symbols:

$C\left(n\right)$: Catalan number and $n$: nonnegative integer

Permalink:

http://dlmf.nist.gov/26.5.E7

Encodings:

pMML, png, TeX

See also:

Annotations for §26.5(iv), §26.5 and Ch.26

16: Software Index

… ►

This is software of narrow scope developed as a byproduct of a research project and subsequently made available at no cost to the public. The software is often meant to demonstrate new numerical methods or software engineering strategies which were the subject of a research project. When developed, the software typically contains capabilities unavailable elsewhere. While the software may be quite capable, it is typically not professionally packaged and its use may require some expertise. The software is typically provided as source code or via a web-based service, and no support is provided.

►

These are collections of software (e.g. libraries) or interactive systems of a somewhat broad scope. Contents may be adapted from research software or may be contributed by project participants who donate their services to the project. The software is made freely available to the public, typically in source code form. While formal support of the collection may not be provided by its developers, within active projects there is often a core group who donate time to consider bug reports and make updates to the collection.

►

An increasing number of published books have included digital media containing software described in the book. Often, the collection of software covers a fairly broad area. Such software is typically developed by the book author. While it is not professionally packaged, it often provides a useful tool for readers to experiment with the concepts discussed in the book. The software itself is typically not formally supported by its authors.

►

Such software ranges from a collection of reusable software parts (e.g., a library) to fully functional interactive computing environments with an associated computing language. Such software is usually professionally developed, tested, and maintained to high standards. It is available for purchase, often with accompanying updates and consulting support.

… ►

A cross index of mathematical software in use at NIST.

17: 14 Legendre and Related Functions

Chapter 14 Legendre and Related Functions

…

18: 27.2 Functions

… ►($\nu \left(1\right)$ is defined to be 0.) Euclid’s Elements (Euclid (1908, Book IX, Proposition 20)) gives an elegant proof that there are infinitely many primes. …They tend to thin out among the large integers, but this thinning out is not completely regular. … ►the sum of the $k$th powers of the positive integers $m\le n$ that are relatively prime to $n$. … ►is the number of $k$-tuples of integers $\le n$ whose greatest common divisor is relatively prime to $n$. …

19: 26.4 Lattice Paths: Multinomial Coefficients and Set Partitions

… ►

§26.4(i) Definitions

… ►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$. … ►(The empty set is considered to have one permutation consisting of no cycles.) … ►

§26.4(iii) Recurrence Relation

…

20: 19.10 Relations to Other Functions

§19.10 Relations to Other Functions

►

§19.10(i) Theta and Elliptic Functions

►For relations of Legendre’s integrals to theta functions, Jacobian functions, and Weierstrass functions, see §§20.9(i), 22.15(ii), and 23.6(iv), respectively. … ►

§19.10(ii) Elementary Functions

… ►For relations to the Gudermannian function $\mathrm{gd}\left(x\right)$ and its inverse ${\mathrm{gd}}^{-1}\left(x\right)$ (§4.23(viii)), see (19.6.8) and …