Search Results for ""

A map which uses a set of rules to transform elements of a sequence into a new sequence using a set of rules which "translate" from the original sequence to its ...

A domatic partition is a partition of the vertices of a graph into disjoint dominating sets. The maximum number of disjoint dominating sets in a domatic partition of a graph ...

If a is an element of a field F over the prime field P, then the set of all rational functions of a with coefficients in P is a field derived from P by adjunction of a.

1. A fixed polyomino. 2. The set of points obtained by taking the centers of a fixed polyomino.

A relation R on a set S is antisymmetric provided that distinct elements are never both related to one another. In other words xRy and yRx together imply that x=y.

One of the Zermelo-Fraenkel axioms which asserts the existence of the empty set emptyset. The axiom may be stated symbolically as exists x forall y(!y in x).

The blossom algorithm (Edmonds 1965) finds a maximum independent edge set in a (possibly weighted) graph. While a maximum independent edge set can be found fairly easily for ...

The number of "prime" boxes is always finite, where a set of boxes is prime if it cannot be built up from one or more given configurations of boxes.

A Mandelbrot set-like fractal obtained by iterating the map z_(n+1)=z_n^3+(z_0-1)z_n-z_0.

A Cartesian product of any finite or infinite set I of copies of Z_2, equipped with the product topology derived from the discrete topology of Z_2. It is denoted Z_2^I. The ...