Search Results for ""

An orthogonal basis of vectors is a set of vectors {x_j} that satisfy x_jx_k=C_(jk)delta_(jk) and x^mux_nu=C_nu^mudelta_nu^mu, where C_(jk), C_nu^mu are constants (not ...

If all elements a_(ij) of an irreducible matrix A are nonnegative, then R=minM_lambda is an eigenvalue of A and all the eigenvalues of A lie on the disk |z|<=R, where, if ...

A distance g on a set that fulfils the same properties as a metric except relaxes the definition to allow the distance between two different points to be zero. An example of ...

A topology on a set X whose open sets are the unions of open balls B(X_0,r)={x in x|g(x_0,x)<r}, where g is a pseudometric on X, x_0 is any point of X, and r>0. There is a ...

Let X be a set. Then a sigma-algebra F is a nonempty collection of subsets of X such that the following hold: 1. X is in F. 2. If A is in F, then so is the complement of A. ...

A group G is a finite or infinite set of elements together with a binary operation (called the group operation) that together satisfy the four fundamental properties of ...

A chord which is a normal at each end. A centrosymmetric set K subset R^d has d double normals through the center (Croft et al. 1991). For a curve of constant width, all ...

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 well ordered set of monomials which also satisfies the condition "u<v implies uw<vw" for all monomials u, v, and w. Examples of monomial orders are the lexicographic order ...

A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.