Search Results for ""

A tree having an infinite number of branches and whose nodes are sequences generated by a set of rules.

A totally disconnected space is a space in which all subsets with more than one element are disconnected. In particular, if it has more than one element, it is a disconnected ...

A partially ordered set P=(X,<=) is an interval order if it is isomorphic to some set of intervals on the real line ordered by left-to-right precedence. Formally, P is an ...

Let K be an algebraically closed field and let I be an ideal in K(x), where x=(x_1,x_2,...,x_n) is a finite set of indeterminates. Let p in K(x) be such that for any ...

In mathematics, the term "collection" is generally used to mean a multiset, i.e., a set in which order is ignored but multiplicity is significant.

The subset consisting of all elements of a given set is called an improper subset (Kamke 1950, p. 6).

A relation R on a set S is symmetric provided that for every x and y in S we have xRy iff yRx. The symmetric relations on n nodes are isomorphic with the rooted graphs on n ...

The (lower) domination number gamma(G) of a graph G is the minimum size of a dominating set of vertices in G, i.e., the size of a minimum dominating set. This is equivalent ...

An edge cut (Holton and Sheehan 1993, p. 14; West 2000, p. 152), edge cut set, edge cutset (Holton and Sheehan 1993, p. 14), or sometimes simply "cut set" or "cutset" (e.g., ...

The underlying set of the fundamental group of X is the set of based homotopy classes from the circle to X, denoted [S^1,X]. For general spaces X and Y, there is no natural ...