Search Results for ""

A graph is planar if it can be drawn in a plane without graph edges crossing (i.e., it has graph crossing number 0). The number of planar graphs with n=1, 2, ... nodes are 1, ...

If alpha is any number and m and n are integers, then there is a rational number m/n for which |alpha-m/n|<=1/n. (1) If alpha is irrational and k is any whole number, there ...

There are several commonly used methods of defining the slippery, but extremely important, concept of a continuous function (which, depending on context, may also be called a ...

A generalized hypergeometric function _pF_q(a_1,...,a_p;b_1,...,b_q;x) is a function which can be defined in the form of a hypergeometric series, i.e., a series for which the ...

A triangle line lalpha+mbeta+ngamma=0 defined relative to a reference triangle is called a central line iff l:m:n is a triangle center (Kimberling 1998, p. 127). If l:m:n is ...

A hypergeometric identity discovered by Ramanujan around 1910. From Hardy (1999, pp. 13 and 102-103), (1) where a^((n))=a(a+1)...(a+n-1) (2) is the rising factorial (a.k.a. ...

The set of points, known as boundary points, which are members of the set closure of a given set S and the set closure of its complement set. The boundary is sometimes called ...

The limit points of a set P, denoted P^'.

Let M^n be an n-manifold and let F={F_alpha} denote a partition of M into disjoint pathwise-connected subsets. Then if F is a foliation of M, each F_alpha is called a leaf ...

A discrete subset of R^s which is closed under addition and subtraction and which contains Z^s as a subset.