Search Results for ""

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 ...

A minimum clique covering is a clique covering of minimum size, and the size of such a minimum clique covering is known as the clique covering number. Note that while a ...

A module homomorphism is a map f:M->N between modules over a ring R which preserves both the addition and the multiplication by scalars. In symbols this means that ...

Obstruction theory studies the extensibility of maps using algebraic gadgets. While the terminology rapidly becomes technical and convoluted (as Iyanaga and Kawada (1980) ...

The l^infty-polynomial norm defined for a polynomial P=a_kx^k+...+a_1x+a_0 by ||P||_infty=max_(k)|a_k|. Note that some authors (especially in the area of Diophantine ...

Let V and W be vector spaces over a field F, and let T:V->W be a linear transformation. Assuming the dimension of V is finite, then dim(V)=dim(Ker(T))+dim(Im(T)), where ...

A seminorm is a function on a vector space V, denoted ||v||, such that the following conditions hold for all v and w in V, and any scalar c. 1. ||v||>=0, 2. ||cv||=|c|||v||, ...

A relation < is a strict order on a set S if it is 1. Irreflexive: a<a does not hold for any a in S. 2. Asymmetric: if a<b, then b<a does not hold. 3. Transitive: a<b and b<c ...

Given a sequence of real numbers a_n, the supremum limit (also called the limit superior or upper limit), written lim sup and pronounced 'lim-soup,' is the limit of ...

Given vectors u and v, the vector direct product, also known as a dyadic, is uv=u tensor v^(T), where tensor is the Kronecker product and v^(T) is the matrix transpose. For ...