Search Results for ""

A coloring of plane regions, link segments, etc., is an assignment of a distinct labeling (which could be a number, letter, color, etc.) to each component. Coloring problems ...

Consider a combination lock consisting of n buttons that can be pressed in any combination (including multiple buttons at once), but in such a way that each number is pressed ...

A monoid that is commutative i.e., a monoid M such that for every two elements a and b in M, ab=ba. This means that commutative monoids are commutative, associative, and have ...

The approximation of a piecewise monotonic function f by a polynomial with the same monotonicity. Such comonotonic approximations can always be accomplished with nth degree ...

Suppose <= is a partial ordering on a nonempty set A. Then the elements a,b in A are said to be comparable provided a<=b or b<=a. Because two elements in a partially ordered ...

A tool with two arms joined at their ends which can be used to draw circles. In geometric constructions, the classical Greek rules stipulate that the compass cannot be used ...

A complemented lattice is an algebraic structure (L, ^ , v ,0,1,^') such that (L, ^ , v ,0,1) is a bounded lattice and for each element x in L, the element x^' in L is a ...

A labeled binary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2 and 3, branches from these leading to 4, 5 and 6, 7, respectively, and so ...

A partially ordered set (or ordered set or poset for short) (L,<=) is called a complete lattice if every subset M of L has a least upper bound (supremum, supM) and a greatest ...

The complete products of a Boolean algebra of subsets generated by a set {A_k}_(k=1)^p of cardinal number p are the 2^p Boolean functions B_1B_2...B_p=B_1 intersection B_2 ...