Search Results for ""

A function f is said to have a upper bound C if f(x)<=C for all x in its domain. The least upper bound is called the supremum. A set is said to be bounded from above if it ...

Let the greatest term H of a sequence be a term which is greater than all but a finite number of the terms which are equal to H. Then H is called the upper limit of the ...

A function A such that B=del xA. The most common use of a vector potential is the representation of a magnetic field. If a vector field has zero divergence, it may be ...

Let S be a set of simple polygonal obstacles in the plane, then the nodes of the visibility graph of S are just the vertices of S, and there is an edge (called a visibility ...

A 4-polyhex.

If 0<=a,b,c,d<=1, then (1-a)(1-b)(1-c)(1-d)+a+b+c+d>=1. This is a special case of the general inequality product_(i=1)^n(1-a_i)+sum_(i=1)^na_i>=1 for 0<=a_1,a_2,...,a_n<=1. ...

A weighted graph is a graph in which each branch is given a numerical weight. A weighted graph is therefore a special type of labeled graph in which the labels are numbers ...

An oriented surface for which every point belongs to a Wiedersehen pair. Proof of the Blaschke conjecture established that the only Wiedersehen surfaces are the standard ...

The Wigner 3j-symbols (j_1 j_2 j_3; m_1 m_2 m_3), also known as "3j symbols" (Messiah 1962, p. 1056) or Wigner coefficients (Shore and Menzel 1968, p. 275) are quantities ...

A knot which is not a tame knot.