Search Results for ""

A minimum edge cover is an edge cover having the smallest possible number of edges for a given graph. The size of a minimum edge cover of a graph is known as the edge cover ...

Define the minimal bounding rectangle as the smallest rectangle containing a given lattice polygon. If the perimeter of the lattice polygon is equal to that of its minimal ...

The conjugate gradient method is an algorithm for finding the nearest local minimum of a function of n variables which presupposes that the gradient of the function can be ...

Cayley's cubic surface is the unique cubic surface having four ordinary double points (Hunt), the maximum possible for cubic surface (Endraß). The Cayley cubic is invariant ...

A unit-distance graph is a distance graph having an embedding in the Euclidean plane (unit-distance embedding) in which vertices are distinct points and all edges are of ...

An official chessboard is an 8×8 board containing squares alternating in color between olive green and buff (where "buff" is a color variously defined as a moderate orange ...

The first Göllnitz-Gordon identity states that the number of partitions of n in which the minimal difference between parts is at least 2, and at least 4 between even parts, ...

When the Gaussian curvature K is everywhere negative, a surface is called anticlastic and is saddle-shaped. A surface on which K is everywhere positive is called synclastic. ...

There are two completely different definitions of Cayley numbers. The first and most commonly encountered type of Cayley number is the eight elements in a Cayley algebra, ...

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