Search Results for ""

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

Given a set S with a subset E, the complement (denoted E^' or E^_) of E with respect to S is defined as E^'={F:F in S,F not in E}. (1) Using set difference notation, the ...

If k is the elliptic modulus of an elliptic integral or elliptic function, then k^'=sqrt(1-k^2) (1) is called the complementary modulus. Complete elliptic integrals with ...

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

A surface which is simultaneously complete and minimal. There have been a large number of fundamental breakthroughs in the study of such surfaces in recent years, and they ...

A set of orthogonal functions {phi_n(x)} is termed complete in the closed interval x in [a,b] if, for every piecewise continuous function f(x) in the interval, the minimum ...

A set of numbers a_0, a_1, ..., a_(m-1) (mod m) form a complete set of residues, also called a covering system, if they satisfy a_i=i (mod m) for i=0, 1, ..., m-1. For ...