Search Results for ""

Let p be an odd prime, a be a positive number such that pa (i.e., p does not divide a), and let x be one of the numbers 1, 2, 3, ..., p-1. Then there is a unique x^', called ...

Given a group action G×F->F and a principal bundle pi:A->M, the associated fiber bundle on M is pi^~:A×F/G->M. (1) In particular, it is the quotient space A×F/G where ...

A Sheffer sequence for (1,f(t)) is called the associated sequence for f(t), and a sequence s_n(x) of polynomials satisfying the orthogonality conditions ...

Three elements x, y and z of a set S are said to be associative under a binary operation * if they satisfy x*(y*z)=(x*y)*z. (1) Real numbers are associative under addition ...

A sequence {x_n} is called an infinitive sequence if, for every i, x_n=i for infinitely many n. Write a(i,j) for the jth index n for which x_n=i. Then as i and j range ...

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.

The asterisk *, also called a "star," is used for a number of different purposed in mathematics. The most common usage is to denote multiplication so, for example, 2*3=2×3=6. ...

An asymmetric matrix is a square matrix that is not symmetric, i.e., a matrix A such that A^(T)!=A, where A^(T) denotes the transpose. An asymmetric matrix therefore ...

Asymptotic behavior. A useful yet endangered word, found rarely outside the captivity of the Oxford English Dictionary (Simpson and Weiner 1992, p. 82).

A theorem from information theory that is a simple consequence of the weak law of large numbers. It states that if a set of values X_1, X_2, ..., X_n is drawn independently ...