Search Results for ""

A sum of the elements from some set with constant coefficients placed in front of each. For example, a linear combination of the vectors x, y, and z is given by ax+by+cz, ...

In abstract topology, a machine is method for producing infinite loop spaces and spectra. In automata theory, an abstract machine that is implemented in hardware is simply ...

The rank of a matrix or a linear transformation is the dimension of the image of the matrix or the linear transformation, corresponding to the number of linearly independent ...

A matrix each of whose elements is a variate. These variates need not be independent, and if they are not, a correlation is said to exist between them.

If F is a sigma-algebra and A is a subset of X, then A is called measurable if A is a member of F. X need not have, a priori, a topological structure. Even if it does, there ...

For a given n, is the problem of determining if a set is mortal solvable? n=1 is solvable, n=2 is unknown, and n>=3 is unsolvable.

A near-perfect matching is a matching in which a single vertex is left unmatched. Just as perfect matchings can occur only for graphs with an even number of vertices, ...

g_(ij)=[0 1 0 0; 1 0 0 0; 0 0 0 -1; 0 0 -1 0]. It can be expressed as g_(ab)=l_an_b+l_bn_a-m_am^__b-m_bm^__a.

A number theoretic function is a function whose domain is the set of positive integers.

The study of numbers for the supposed purpose of predicting future events or seeking connections with the occult.