Search Results for ""

Every dense linear order complete set without endpoints having at most omega disjoint intervals is order isomorphic to the continuum of real numbers, where omega is the set ...

A point which does not lie on at least one ordinary line.

A moving average using 15 points having weights -3, -6, -5, 3, 21, 46, 67, 74, 67, 46, 21, 3, -5, -6, and -3. It is sometimes used by actuaries.

A three-colorable graph G is a graph with chromatic number chi(G)<=3.

A polynomial is called unimodal if the sequence of its coefficients is unimodal. If P(x) is log-convex and Q(x) is unimodal, then P(x)Q(x) is unimodal.

A fixed point for which the stability matrix has eigenvalues of the form lambda_+/-=alpha+/-ibeta (with alpha,beta>0).

A weighted graph is a graph in which each branch is given a numerical weight. A weighted graph is therefore a special type of labeled graph in which the labels are numbers ...

A nonconformal, equal-area projection which is a special case of the Bonne projection where one of the poles is taken as the standard parallel. Because of its heart shape, ...

The second blackboard problem in the 1997 film Good Will Hunting asks for all the series-reduced trees (referred to by the alternate term "homeomorphically irreducible trees" ...

The center of a graph G is the set of vertices of graph eccentricity equal to the graph radius (i.e., the set of central points). In the above illustration, center nodes are ...