Search Results for ""

where _5F_4(a,b,c,d,e;f,g,h,i;z) is a generalized hypergeometric function and Gamma(z) is the gamma function. Bailey (1935, pp. 25-26) called the Dougall-Ramanujan identity ...

An exponential generating function for the integer sequence a_0, a_1, ... is a function E(x) such that E(x) = sum_(k=0)^(infty)a_k(x^k)/(k!) (1) = ...

An entire function f is said to be of finite order if there exist numbers a,r>0 such that |f(z)|<=exp(|z|^a) for all |z|>r. The infimum of all numbers a for which this ...

The Fourier transform of the constant function f(x)=1 is given by F_x[1](k) = int_(-infty)^inftye^(-2piikx)dx (1) = delta(k), (2) according to the definition of the delta ...

The Fourier transform of the Heaviside step function H(x) is given by F_x[H(x)](k) = int_(-infty)^inftye^(-2piikx)H(x)dx (1) = 1/2[delta(k)-i/(pik)], (2) where delta(k) is ...

A finite extension K=Q(z)(w) of the field Q(z) of rational functions in the indeterminate z, i.e., w is a root of a polynomial a_0+a_1alpha+a_2alpha^2+...+a_nalpha^n, where ...

A global maximum, also known as an absolute maximum, the largest overall value of a set, function, etc., over its entire range. It is impossible to construct an algorithm ...

A global minimum, also known as an absolute minimum, is the smallest overall value of a set, function, etc., over its entire range. It is impossible to construct an algorithm ...

Every graph with n vertices and maximum vertex degree Delta(G)<=k is (k+1)-colorable with all color classes of size |_n/(k+1)_| or [n/(k+1)], where |_x_| is the floor ...

A root-finding algorithm also called Bailey's method and Hutton's method. For a function of the form g(x)=x^d-r, Lambert's method gives an iteration function ...