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 ...

int_0^(pi/2)cos^nxdx = int_0^(pi/2)sin^nxdx (1) = (sqrt(pi)Gamma(1/2(n+1)))/(nGamma(1/2n)) (2) = ((n-1)!!)/(n!!){1/2pi for n=2, 4, ...; 1 for n=3, 5, ..., (3) where Gamma(n) ...

int_0^inftyJ_0(ax)cos(cx)dx={0 a<c; 1/(sqrt(a^2-c^2)) a>c (1) int_0^inftyJ_0(ax)sin(cx)dx={1/(sqrt(c^2-a^2)) a<c; 0 a>c, (2) where J_0(z) is a zeroth order Bessel function of ...

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, ...

_8phi_7[a,qa^(1/2),-qa^(1/2),b,c,d,e,q^(-N); a^(1/2),-a^(1/2),(aq)/b,(aq)/c,(aq)/d,(aq)/e,aq^(N+1);q,(aq^(N+2))/(bcde)] ...

Catastrophe theory studies how the qualitative nature of equation solutions depends on the parameters that appear in the equations. Subspecializations include bifurcation ...

The divided difference f[x_0,x_1,x_2,...,x_n], sometimes also denoted [x_0,x_1,x_2,...,x_n] (Abramowitz and Stegun 1972), on n+1 points x_0, x_1, ..., x_n of a function f(x) ...

Lagrange multipliers, also called Lagrangian multipliers (e.g., Arfken 1985, p. 945), can be used to find the extrema of a multivariate function f(x_1,x_2,...,x_n) subject to ...

A direct search method of optimization that works moderately well for stochastic problems. It is based on evaluating a function at the vertices of a simplex, then iteratively ...

The polar sine is a function of a vertex angle of an n-dimensional parallelotope or simplex. If the content of the parallelotope is P and the lengths of the n edges of the ...