Search Results for ""

An n-component of a graph G is a maximal n-connected subgraph.

A set X is called a "cone" with vertex at the origin if for any x in X and any scalar a>=0, ax in X.

An equation of the form f(x)=b (mod m), (1) where the values of 0<=x<m for which the equation holds are sought. Such an equation may have none, one, or many solutions. There ...

A set X is a called a "convex cone" if for any x,y in X and any scalars a>=0 and b>=0, ax+by in X.

The surface given by the parametric equations x = e^(bv)cosv+e^(av)cosucosv (1) y = e^(bv)sinv+e^(av)cosusinv (2) z = e^(av)sinu. (3) For a=b=1, the coefficients of the first ...

A cumulative product is a sequence of partial products of a given sequence. For example, the cumulative products of the sequence {a,b,c,...}, are a, ab, abc, .... Cumulative ...

A linear code C is cyclic if for every codeword (c_0,c_1,...,c_(n-1)) in C, the codeword (c_(n-1),c_0,c_1,...,c_(n-2)) is also in C.

A database can be roughly defined as a structure consisting of 1. A collection of information (the data), 2. A collection of queries that can be submitted, and 3. A ...

The depth of a box is the horizontal distance from front to back (usually not necessarily defined to be smaller than the width, the horizontal distance from side to side).

Given a square matrix M, the following are equivalent: 1. |M|!=0. 2. The columns of M are linearly independent. 3. The rows of M are linearly independent. 4. Range(M) = R^n. ...