Search Results for ""

A formal theory is said to be incomplete if it contains fewer theorems than would be possible while still retaining consistency.

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

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

Two variates A and B are statistically independent iff the conditional probability P(A|B) of A given B satisfies P(A|B)=P(A), (1) in which case the probability of A and B is ...

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.

A branch of topology dealing with topological invariants of manifolds.

One of the basic objects treated in a given formal language system. The term is sometimes also used as a synonym for urelement.