Search Results for ""

The infimum of all number a for which |f(z)|<=exp(|z|^a) holds for all |z|>r and f an entire function, is called the order of f, denoted lambda=lambda(f) (Krantz 1999, p. ...

delta(r)=sqrt(r)-2alpha(r), where alpha(r) is the elliptic alpha function.

A fiveleaper graph is a graph formed by all possible moves of a hypothetical chess piece called a "fiveleaper" which moves analogously to a knight except that it is ...

An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...

The rhombic triacontahedral graph is Archimedean dual graph which is the skeleton of the rhombic triacontahedron, great rhombic triacontahedron, and small triambic ...

If f is continuous on a closed interval [a,b], then there is at least one number x^* in [a,b] such that int_a^bf(x)dx=f(x^*)(b-a). The average value of the function (f^_) on ...

A function f(t) of one or more parameters containing a noise term epsilon(t) f(t)=L(t)+epsilon(t), where the noise is (without loss of generality) assumed to be additive.

The shah function is defined by m(x) = sum_(n=-infty)^(infty)delta(x-n) (1) = sum_(n=-infty)^(infty)delta(x+n), (2) where delta(x) is the delta function, so m(x)=0 for x not ...

The "contiguous USA graph" is the graph whose vertices represent the contiguous 48 states of the United States plus the District of Columbia (DC) and whose edges connect ...

The nth-order Menger sponge graph is the connectivity graph of cubes in the nth iteration of the Menger sponge fractal. The first two iterations are shown above. The n-Menger ...