Search Results for ""

A nonplanar graph G is said to be critical nonplanar if the removal of a vertex results in a planar graph for every vertex of G. Critical nonplanar graphs differ from apex ...

A plot of the cumulative frequency against the upper class boundary with the points joined by line segments. Any continuous cumulative frequency curve, including a cumulative ...

The cut elimination theorem, also called the "Hauptsatz" (Gentzen 1969), states that every sequent calculus derivation can be transformed into another derivation with the ...

A dependent variable is a variable whose value depends on the values of one or more other independent variables. This notion comes up regularly in a variety of contexts. In ...

Any lemma on commutative diagrams. It can give relations between maps (as in the five lemma) or tell how to construct new diagrams from old ones (as in the snake lemma).

Given any assignment of n-element sets to the n^2 locations of a square n×n array, is it always possible to find a partial Latin square? The fact that such a partial Latin ...

A discrete group is a topological group with the discrete topology. Often in practice, discrete groups arise as discrete subgroups of continuous Lie groups acting on a ...

The disk model is the standard Boolean-Poisson model in two-dimensional continuum percolation theory. In particular, the disk model is characterized by the existence of a ...

A number n is said to be divisible by d if d is a divisor of n. The function Divisible[n, d] returns True if an integer n is divisible by an integer d. The product of any n ...

The dominance relation on a set of points in Euclidean n-space is the intersection of the n coordinate-wise orderings. A point p dominates a point q provided that every ...