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

Each point in the convex hull of a set S in R^n is in the convex combination of n+1 or fewer points of S.

A set X is a called a "convex cone" if for any x,y in X and any scalars a>=0 and b>=0, ax+by in X.

A set is said to be bounded from above if it has an upper bound. Consider the real numbers with their usual order. Then for any set M subset= R, the supremum supM exists (in ...

A set is said to be bounded from below if it has a lower bound. Consider the real numbers with their usual order. Then for any set M subset= R, the infimum infM exists (in R) ...

A Julia set with c=-0.123+0.745i, also known as the dragon fractal.

A Cantor set with Lebesgue measure greater than 0.

A distance graph with distance set (0,1].

Let S be a collection of subsets of a set X and let mu:S->[0,infty] be a set function. The function mu is called a premeasure provided that mu is finitely additive, countably ...

The Schnirelmann density of a set of nonnegative integers is the greatest lower bound of the fractions A(n)/n where A(n) is the number of terms in the set <=n.