Search Results for ""

Given a set V of m vectors (points in R^n), the Gram matrix G is the matrix of all possible inner products of V, i.e., g_(ij)=v_i^(T)v_j. where A^(T) denotes the transpose. ...

The kernel of a group homomorphism f:G-->G^' is the set of all elements of G which are mapped to the identity element of G^'. The kernel is a normal subgroup of G, and always ...

Let K be a number field with ring of integers R and let A be a nontrivial ideal of R. Then the ideal class of A, denoted [A], is the set of fractional ideals B such that ...

Conditions at an initial time t=t_0 from which a given set of mathematical equations or physical system evolves. A system with initial conditions specified is known as an ...

Integer programming in a special case of linear programming in which all variables are required to take on integer values only. Set covering deployment is an example ...

An algebraic variety is called irreducible if it cannot be written as the union of nonempty algebraic varieties. For example, the set of solutions to xy=0 is reducible ...

A finite set of contraction maps w_i for i=1, 2, ..., N, each with a contractivity factor s<1, which map a compact metric space onto itself. It is the basis for fractal image ...

Let S={x_1,...,x_n} be a set of n distinct positive integers. Then the matrix [S]_n having the least common multiple LCM(x_i,x_j) of x_i and x_j as its i,jth entry is called ...

L=sigma/(sigma_B), where sigma is the variance in a set of s Lexis trials and sigma_B is the variance assuming Bernoulli trials. If L<1, the trials are said to be subnormal, ...

A map is a way of associating unique objects to every element in a given set. So a map f:A|->B from A to B is a function f such that for every a in A, there is a unique ...