Search Results for ""

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

A number n for which a shortest chain exists which is a Brauer chain is called a Brauer number. There are infinitely many non-Brauer numbers.

An interval in which one endpoint is included but not the other. A half-closed interval is denoted [a,b) or (a,b] and is also called a half-open interval. The non-standard ...

A set of methods that are generally superior to ANOVA for small data sets or where sample distributions are non-normal.

A pseudograph is a non-simple graph in which both graph loops and multiple edges are permitted (Zwillinger 2003, p. 220).

A shaky polyhedron is a non-rigid concave polyhedron which is only infinitesimally movable. Jessen's orthogonal icosahedron is a shaky polyhedron (Wells 1991).

Let A be some attribute (e.g., possible, present, perfect, etc.). If all is A, then the non-A must also be A. For example, "All is possible, the impossible too," and "Nothing ...

The configuration formed by two curves starting at a point, called the vertex V, in a common direction. Horn angles are concrete illustrations of non-Archimedean geometries.

The distance polynomial is the characteristic polynomial of the graph distance matrix. The following table summarizes distance polynomials for some common classes of graphs. ...

The conjugate gradient method can be viewed as a special variant of the Lanczos method for positive definite symmetric systems. The minimal residual method (MINRES) and ...