Search Results for ""

An expression is called "well-defined" (or "unambiguous") if its definition assigns it a unique interpretation or value. Otherwise, the expression is said to not be ...

A generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z] is said to be well-poised if p=q+1 and ...

Whipple derived a great many identities for generalized hypergeometric functions, many of which are consequently known as Whipple's identities (transformations, etc.). Among ...

(Bailey 1935, p. 25), where _7F_6(a_1,...,a_7;b_1,...,b_6) and _4F_3(a_1,...,a_4;b_1,b_2,b_3) are generalized hypergeometric functions with argument z=1 and Gamma(z) is the ...

(d^2u)/(dz^2)+(du)/(dz)+(k/z+(1/4-m^2)/(z^2))u=0. (1) Let u=e^(-z/2)W_(k,m)(z), where W_(k,m)(z) denotes a Whittaker function. Then (1) becomes ...

Two points P,Q on a compact Riemann surface such that P lies on every geodesic passing through Q, and conversely. An oriented surface where every point belongs to a ...

A sequence of uncorrelated numbers alpha_n developed by Wiener (1926-1927). The numbers are constructed by beginning with {1,-1}, (1) then forming the outer product with ...

The orthogonal polynomials defined variously by (1) (Koekoek and Swarttouw 1998, p. 24) or p_n(x;a,b,c,d) = W_n(-x^2;a,b,c,d) (2) = (3) (Koepf, p. 116, 1998). The first few ...

Wolfram's iteration is an algorithm for computing the square root of a rational number 1<=r<4 using properties of the binary representation of r. The algorithm begins with ...

The Wolstenholme numbers are defined as the numerators of the generalized harmonic number H_(n,2) appearing in Wolstenholme's theorem. The first few are 1, 5, 49, 205, 5269, ...