Search Results for ""

A function f(x) is said to be constructible if some algorithm F computes it, in binary, within volume O(f(x)), i.e., V_(F(x))=O(f(x)). Here, the volume V_(A(x)) is the ...

A hypergeometric function in which one parameter changes by +1 or -1 is said to be contiguous. There are 26 functions contiguous to _2F_1(a,b;c;x) taking one pair at a time. ...

The region 0<sigma<1, where sigma is defined as the real part of a complex number s=sigma+it. All nontrivial zeros (i.e., those not at negative even integers) of the Riemann ...

Dini's theorem is a result in real analysis relating pointwise convergence of sequences of functions to uniform convergence on a closed interval. For an increasing sequence ...

A number n is said to be divisible by d if d is a divisor of n. The function Divisible[n, d] returns True if an integer n is divisible by an integer d. The product of any n ...

The double bar symbol | is used to denote certain kinds of norms in mathematics (e.g., ||x|| or ||x||_2). It is also used to denote parallel lines, as in A∥B, and in an older ...

Let the values of a function f(x) be tabulated at points x_i equally spaced by h=x_(i+1)-x_i, so f_1=f(x_1), f_2=f(x_2), ..., f_n=f(x_n). Then Durand's rule approximating the ...

The Elsasser function is defined by the integral E(y,u)=int_(-1/2)^(1/2)exp[-(2piyusinh(2piy))/(cosh(2piy)-cos(2pix))]dx. (1) Special values include E(0,u) = 1 (2) E(y,0) = ...

To enumerate a set of objects satisfying some set of properties means to explicitly produce a listing of all such objects. The problem of determining or counting all such ...

An array of "trees" of unit height located at integer-coordinate points in a point lattice. When viewed from a corner along the line y=x in normal perspective, a quadrant of ...