Search Results for ""

A continuum that is not decomposable is an indecomposable continuum.

An n×n complex matrix A is called indefinite if nonzero vectors x and y exist such that x^*Ax>0>y^*Ay, where x^* denotes the conjugate transpose. A matrix m may be tested to ...

A quadratic form Q(x) is indefinite if it is less than 0 for some values and greater than 0 for others. The quadratic form, written in the form (x,Ax), is indefinite if ...

The indefinite summation operator Delta^(-1) for discrete variables, is the equivalent of integration for continuous variables. If DeltaY(x)=y(x), then Delta^(-1)y(x)=Y(x).

If sets E and F are independent, then so are E and F^', where F^' is the complement of F (i.e., the set of all possible outcomes not contained in F). Let union denote "or" ...

The ratio of the independence number of a graph G to its vertex count is known as the independence ratio of G (Bollobás 1981). The product of the chromatic number and ...

A set of graph vertices A of a graph with graph edges V is independent if it contains no graph edges.

The indices of a contravariant tensor A^j can be lowered, turning it into a covariant tensor A_i, by multiplication by a so-called metric tensor g_(ij), e.g., g_(ij)A^j=A_i.

The indices of a covariant tensor A_j can be raised, forming a contravariant tensor A^i, by multiplication by a so-called metric tensor g^(ij), e.g., g^(ij)A_j=A^i

A set whose members index (label) members of another set. For example, in the set A= union _(k in K)A_k, the set K is an index set of the set A.