Search Results for ""

Let K be a finite complex, let h:|K|->|K| be a continuous map. If Lambda(h)!=0, then h has a fixed point.

Linear programming, sometimes known as linear optimization, is the problem of maximizing or minimizing a linear function over a convex polyhedron specified by linear and ...

The span of an unoriented link diagram (also called the link spread) is the difference between the highest and lowest degrees of its bracket polynomial. The span is a ...

A function whose value decreases to zero more slowly than any nonzero polynomial is said to be a logarithmically decreasing function. The prototypical example is the function ...

Let rho(x) be an mth degree polynomial which is nonnegative in [-1,1]. Then rho(x) can be represented in the form {[A(x)]^2+(1-x^2)[B(x)]^2 for m even; ...

A Lyndon word is an aperiodic notation for representing a necklace.

Let a patch be given by the map x:U->R^n, where U is an open subset of R^2, or more generally by x:A->R^n, where A is any subset of R^2. Then x(U) (or more generally, x(A)) ...

The power A^n of a matrix A for n a nonnegative integer is defined as the matrix product of n copies of A, A^n=A...A_()_(n). A matrix to the zeroth power is defined to be the ...

The eigenvalues of a matrix A are called its spectrum, and are denoted lambda(A). If lambda(A)={lambda_1,...,lambda_n}, then the determinant of A is given by ...

A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...