Search Results for ""

The n-roll mill curve is given by the equation x^n-(n; 2)x^(n-2)y^2+(n; 4)x^(n-4)y^4-...=a^n, where (n; k) is a binomial coefficient.

A minimal edge cover is an edge cover of a graph that is not a proper subset of any other edge cover. Every minimum edge cover is a minimal edge cover, but the converse does ...

A matrix with 0 determinant whose determinant becomes nonzero when any element on or below the diagonal is changed from 0 to 1. An example is M=[1 -1 0 0; 0 0 -1 0; 1 1 1 -1; ...

Given a collection of sets, a member set that is not a proper subset of another member set is called a minimal set. Minimal sets are important in graph theory, since many ...

A minimal vertex cut is an vertex cut of a graph that is not a proper subset of any other vertex cut. Every minimum vertex cut is a minimal vertex cut, but the converse does ...

The approximating polynomial which has the smallest maximum deviation from the true function. It is closely approximated by the Chebyshev polynomials of the first kind.

The minimum vertex degree, sometimes simply called the minimum degree, of a graph G is the smallest vertex degree of G, denoted delta.

The Minkowski measure of a bounded, closed set is the same as its Lebesgue measure.

The sum of sets A and B in a vector space, equal to {a+b:a in A,b in B}.

A minor arc (left figure) is an arc of a circle having measure less than or equal to 180 degrees (pi radians).