Search Results for ""

An example of a subspace of the Euclidean plane that is connected but not pathwise-connected with respect to the relative topology. It is formed by the ray y=0, x<=0 and the ...

A set function mu possesses countable additivity if, given any countable disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union ...

For a connected graph G of graph diameter d, the distance-k graph G_k for k=1, ..., d is a graph with the same vertex set and having edge set consisting of the pairs of ...

A knot invariant is a function from the set of all knots to any other set such that the function does not change as the knot is changed (up to isotopy). In other words, a ...

The upper domination number Gamma(G) of a graph G is the maximum size of a minimal dominating set of vertices in G. The (lower) domination number may be similarly defined as ...

A positive integer: 1, 2, 3, 4, ... (OEIS A000027), also called a natural number. However, zero (0) is sometimes also included in the list of counting numbers. Due to lack of ...

Let O be an incidence geometry, i.e., a set with a symmetric, reflexive binary relation I. Let e and f be elements of O. Let an incidence plane be an incidence geometry whose ...

Let t be an infinite word over a finite alphabet Sigma. Then there exists a uniformly recurrent infinite word r such that Sub(r) subset= Sub(t), where Sub(w) is the set of ...

An orthogonal array OA(k,s) is a k×s^2 array with entries taken from an s-set S having the property that in any two rows, each ordered pair of symbols from S occurs exactly ...

A level set in two dimensions. Phase curves are sometimes also known as level curves (Tabor 1989, p. 14).