Search Results for ""

The term domain has (at least) three different meanings in mathematics. The term domain is most commonly used to describe the set of values D for which a function (map, ...

A quantified system of real algebraic equations and inequalities in variables {x_1,...,x_n} is an expression QS=Q_1(y_1)Q_2(y_2)...Q_m(y_m)S(x_1,...,x_n;y_1,...,y_m), where Q ...

The set of all zero-systems of a group G is denoted B(G) and is called the block monoid of G since it forms a commutative monoid under the operation of zero-system addition ...

The homeomorphic image of a so-called "complete separable" metric space. The continuous image of a Polish space is called a Souslin set.

A sigma-algebra which is related to the topology of a set. The Borel sigma-algebra is defined to be the sigma-algebra generated by the open sets (or equivalently, by the ...

Integer programming in a special case of linear programming in which all variables are required to take on integer values only. Set covering deployment is an example ...

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

Let S be a collection of subsets of a finite set X. A subset Y of X that meets every member of S is called the vertex cover, or hitting set. A vertex cover of a graph G can ...

A free idempotent monoid is a monoid that satisfies the identity x^2=x and is generated by a set of elements. If the generating set of such a monoid is finite, then so is the ...

Let P be a finite partially ordered set. A chain in P is a set of pairwise comparable elements (i.e., a totally ordered subset). The partial order length of P is the maximum ...