Search Results for ""

A tree to whose nodes and/or edges labels (usually number) are assigned. The word "weight" also has a more specific meaning when applied to trees, namely the weight of a tree ...

A sequence of uncorrelated numbers alpha_n developed by Wiener (1926-1927). The numbers are constructed by beginning with {1,-1}, (1) then forming the outer product with ...

Let f be a real-valued, continuous, and strictly increasing function on [0,c] with c>0. If f(0)=0, a in [0,c], and b in [0,f(c)], then int_0^af(x)dx+int_0^bf^(-1)(x)dx>=ab, ...

A zonal harmonic is a spherical harmonic of the form P_l(costheta), i.e., one which reduces to a Legendre polynomial (Whittaker and Watson 1990, p. 302). These harmonics are ...

From the point of view of coordinate charts, the notion of tangent space is quite simple. The tangent space consists of all directions, or velocities, a particle can take. In ...

The Seidel-Entringer-Arnold triangle is the number triangle consisting of the Entringer numbers E_(n,k) arranged in "ox-plowing" order, ...

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

The generalized minimal residual (GMRES) method (Saad and Schultz 1986) is an extension of the minimal residual method (MINRES), which is only applicable to symmetric ...

Given a "good" graph G (i.e., one for which all intersecting graph edges intersect in a single point and arise from four distinct graph vertices), the crossing number is the ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. The figure above shows independent sets ...