Search Results for ""

The gamma product (e.g., Prudnikov et al. 1986, pp. 22 and 792), is defined by Gamma[a_1,...,a_m; b_1,...,b_n]=(Gamma(a_1)...Gamma(a_m))/(Gamma(b_1)...Gamma(b_n)), where ...

J_n(z) = 1/(2pi)int_(-pi)^pie^(izcost)e^(in(t-pi/2))dt (1) = (i^(-n))/piint_0^pie^(izcost)cos(nt)dt (2) = 1/piint_0^picos(zsint-nt)dt (3) for n=0, 1, 2, ..., where J_n(z) is ...

e^(izcostheta)=sum_(n=-infty)^inftyi^nJ_n(z)e^(intheta), where J_n(z) is a Bessel function of the first kind. The identity can also be written ...

The symbol defined by c^(a/b) = c(c+b)(c+2b)...[c+(a-1)b] (1) = b^a(c/b)_a (2) = (b^aGamma(a+c/b))/(Gamma(c/b)), (3) where (a)_n is the Pochhammer symbol and Gamma(z) is the ...

A function f(x) is logarithmically convex on the interval [a,b] if f>0 and lnf(x) is convex on [a,b]. If f(x) and g(x) are logarithmically convex on the interval [a,b], then ...

A piecewise linear function is a function composed of some number of linear segments defined over an equal number of intervals, usually of equal size. For example, consider ...

A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...

A graph G whose line graph is L(G) is called the root graph R(L(G)) of L(G). In order words, R(L(G))=G. The root graph of a connected graph is unique except for K_3=C_3 (the ...

A 24-dimensional Euclidean lattice. An automorphism of the Leech lattice modulo a center of two leads to the Conway group Co_1. Stabilization of the one- and two-dimensional ...

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...