Search Results for ""

In its simplest form, the principle of permanence states that, given any analytic function f(z) defined on an open (and connected) set U of the complex numbers C, and a ...

The signature of a non-degenerate quadratic form Q=y_1^2+y_2^2+...+y_p^2-y_(p+1)^2-y_(p+2)^2-...-y_r^2 of rank r is most often defined to be the ordered pair (p,q)=(p,r-p) of ...

R(p,tau)=int_(-infty)^inftyint_(-infty)^inftyf(x,y)delta[y-(tau+px)]dydx, (1) where f(x,y)={1 for x,y in [-a,a]; 0 otherwise (2) and ...

A recurrence plot is defined as a plot of the quantity R(t,tau)=H(epsilon-||f(t)-f(tau)||), where H(x) is the Heaviside step function and ||f|| denotes a norm. A recurrence ...

A square n×n matrix A=a_(ij) is called reducible if the indices 1, 2, ..., n can be divided into two disjoint nonempty sets i_1, i_2, ..., i_mu and j_1, j_2, ..., j_nu (with ...

A reflection relation is a functional equation relating f(-x) to f(x), or more generally, f(a-x) to f(x). Perhaps the best known example of a reflection formula is the gamma ...

Sprague (1963) considered the problem of "rolling" five cubes, each which an upright letter "A" on its top, on a chessboard. Here "rolling" means the cubes are moved from ...

|_n]!={n! for n>=0; ((-1)^(-n-1))/((-n-1)!) for n<0. (1) The Roman factorial arises in the definition of the harmonic logarithm and Roman coefficient. It obeys the identities ...

Rosser's rule states that every Gram block contains the expected number of roots, which appears to be true for computable Gram blocks. Rosser et al. (1969) expressed a belief ...

The process of approximating a quantity, be it for convenience or, as in the case of numerical computations, of necessity. If rounding is performed on each of a series of ...