Search Results for ""

The vertex height of a vertex v in a rooted tree is the number of edges on the longest downward path between v and a tree leaf. The height of the root vertex of a rooted tree ...

There are at least two theorems known as Weierstrass's theorem. The first states that the only hypercomplex number systems with commutative multiplication and addition are ...

A lattice path from one point to another is p-good if it lies completely below the line y=(p-1)x. (1) Hilton and Pederson (1991) show that the number of p-good paths from (1, ...

Clausen's _4F_3 identity _4F_3(a,b,c,d; e,f,g;1)=((2a)_(|d|)(a+b)_(|d|)(2b)_(|d|))/((2a+2b)_(|d|)a_(|d|)b_(|d|)), (1) holds for a+b+c-d=1/2, e=a+b+1/2, a+f=d+1=b+g, where d a ...

Denoted zn(u,k) or Z(u). Z(phi|m)=E(phi|m)-(E(m)F(phi|m))/(K(m)), where phi is the Jacobi amplitude, m is the parameter, and F(phi|m) and K(m) are elliptic integrals of the ...

The Petersen graph is the cubic graph on 10 vertices and 15 edges which is the unique (3,5)-cage graph (Harary 1994, p. 175), as well as the unique (3,5)-Moore graph. It can ...

Among the continuous functions on R^n, the positive definite functions are those functions which are the Fourier transforms of nonnegative Borel measures.

The sequence generated by repeated application of a map. The map is said to have a closed orbit if it has a finite number of elements.

Let there be two particularly well-behaved functions F(x) and p_tau(x). If the limit lim_(tau->0)int_(-infty)^inftyp_tau(x)F(x)dx exists, then p_tau(x) is a regular sequence ...

An equation or formula involving transcendental functions.