Search Results for ""

The level set of a differentiable function f:R^n->R corresponding to a real value c is the set of points {(x_1,...,x_n) in R^n:f(x_1,...,x_n)=c}. For example, the level set ...

A bounded entire function in the complex plane C is constant. The fundamental theorem of algebra follows as a simple corollary.

A locus is the set of all points (usually forming a curve or surface) satisfying some condition. For example, the locus of points in the plane equidistant from a given point ...

Mann's theorem is a theorem widely circulated as the "alpha-beta conjecture" that was subsequently proven by Mann (1942). It states that if A and B are sets of integers each ...

If a group of men and women may date only if they have previously been introduced, then a complete set of dates is possible iff every subset of men has collectively been ...

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...

A maximal ideal of a ring R is an ideal I, not equal to R, such that there are no ideals "in between" I and R. In other words, if J is an ideal which contains I as a subset, ...

A maximal independent edge set of a graph is an independent edge set that cannot be expanded to another independent edge set by addition of any edge in the graph. Note that a ...

Minesweeper is single-player logic-based computer game played on rectangular board whose object is to locate a predetermined number of randomly-placed "mines" in the shortest ...

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