Search Results for ""

Discrete mathematics is the branch of mathematics dealing with objects that can assume only distinct, separated values. The term "discrete mathematics" is therefore used in ...

The m×n knight graph is a graph on mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a knight (which may ...

A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...

The Lambert W-function, also called the omega function, is the inverse function of f(W)=We^W. (1) The plot above shows the function along the real axis. The principal value ...

The generalized hypergeometric function is given by a hypergeometric series, i.e., a series for which the ratio of successive terms can be written ...

A class of processes which attempt to round off a domain and simplify its theory by adjoining elements.

Let E and F be paired spaces with S a family of absolutely convex bounded sets of F such that the sets of S generate F and, if B_1,B_2 in S, then there exists a B_3 in S such ...

Krasner's lemma states that if K a complete field with valuation v, K^_ is a fixed algebraic closure of K together with the canonical extension of v, and K^_^^ is its ...

The space called L^infty (ell-infinity) generalizes the L-p-spaces to p=infty. No integration is used to define them, and instead, the norm on L^infty is given by the ...

The exponent laws, also called the laws of indices (Higgens 1998) or power rules (Derbyshire 2004, p. 65), are the rules governing the combination of exponents (powers). The ...