Search Results for ""

A theory which satisfies all the Eilenberg-Steenrod axioms with the possible exception of the long exact sequence of a pair axiom, as well as a certain additional continuity ...

A number that is "close" to (but not equal to) zero may be called an almost zero. In contrast, a number or expression that is equal to zero is said to be identically zero. ...

An anchor is the bundle map rho from a vector bundle A to the tangent bundle TB satisfying 1. [rho(X),rho(Y)]=rho([X,Y]) and 2. [X,phiY]=phi[X,Y]+(rho(X)·phi)Y, where X and Y ...

An anti-analytic function is a function f satisfying the condition (df)/(dz)=0. (1) Using the result ...

Suppose P=p:q:r and U=u:v:w are points, neither lying on a sideline of DeltaABC. Then the P-anticomplementary conjugate of U is the point where h(a,b,c,p,q,r,u,v,w) ...

An arithmetic progression, also known as an arithmetic sequence, is a sequence of n numbers {a_0+kd}_(k=0)^(n-1) such that the differences between successive terms is a ...

For an algebra A, the associator is the trilinear map A×A×A->A given by (x,y,z)=(xy)z-x(yz). The associator is identically zero iff A is associative.

Let the characteristic polynomial of an n×n complex matrix A be written in the form P(lambda) = |lambdaI-A| (1) = ...

A shuffling algorithm used in a class of random number generators.

For P, Q, R, and S polynomials in n variables [P·Q,R·S]=sum_(i_1,...,i_n>=0)A/(i_1!...i_n!), (1) where A=[R^((i_1,...,i_n))(D_1,...,D_n)Q(x_1,...,x_n) ...