Search Results for ""

For s_1,s_2=+/-1, lim_(epsilon_1->0; epsilon_2->0)1/(x_1-is_1epsilon_1)1/(x_2-is_2epsilon_2) =[PV(1/(x_1))+ipis_1delta(x_1)][PV(1/(x_2))+ipis_2delta(x_2)] ...

Theta(G;A)=<theta(a):a in A-1> is an A-invariant solvable p^'-subgroup of G.

If (sinalpha)/(sinbeta)=m/n, then (tan[1/2(alpha-beta)])/(tan[1/2(alpha+beta)])=(m-n)/(m+n).

A k-matrix is a kind of cube root of the identity matrix (distinct from the identity matrix) which is defined by the complex matrix k=[0 0 -i; i 0 0; 0 1 0]. It satisfies ...

Newton's method, also called the Newton-Raphson method, is a root-finding algorithm that uses the first few terms of the Taylor series of a function f(x) in the vicinity of a ...

A convex body in Euclidean space that is centrally symmetric with center at the origin is determined among all such bodies by its brightness function (the volume of each ...

If g(theta) is a trigonometric polynomial of degree m satisfying the condition |g(theta)|<=1 where theta is arbitrary and real, then g^'(theta)<=m.

There exists a total computable predicate P such that for any algorithm computing P(x) with running time T(x), there exists another algorithm computing P(x) with computation ...

Every continuous map f:S^n->R^n must identify a pair of antipodal points.

If the total group of the canonical series is divided into two parts, the difference between the number of points in each part and the double of the dimension of the complete ...