Search Results for ""

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

An attractive tiling of the square composed of two types of triangular tiles. It consists of 16 equilateral triangles and 32 15 degrees-15 degrees-150 degrees isosceles ...

On a measure space X, the set of square integrable L2-functions is an L^2-space. Taken together with the L2-inner product with respect to a measure mu, <f,g>=int_Xfgdmu (1) ...

An approximation for the gamma function Gamma(z+1) with R[z]>0 is given by Gamma(z+1)=sqrt(2pi)(z+sigma+1/2)^(z+1/2)e^(-(z+sigma+1/2))sum_(k=0)^inftyg_kH_k(z), (1) where ...

With a large enough sample, any outrageous thing is likely to happen (Diaconis and Mosteller 1989). Littlewood (1986) considered an event which occurs one in a million times ...

Let S_n be the sum of n random variates X_i with a Bernoulli distribution with P(X_i=1)=p_i. Then sum_(k=0)^infty|P(S_n=k)-(e^(-lambda)lambda^k)/(k!)|<2sum_(i=1)^np_i^2, ...

The Lebesgue measure is an extension of the classical notions of length and area to more complicated sets. Given an open set S=sum_(k)(a_k,b_k) containing disjoint intervals, ...

Gamma functions of argument 2z can be expressed in terms of gamma functions of smaller arguments. From the definition of the beta function, ...

A link invariant defined for a two-component oriented link as the sum of +1 crossings and -1 crossing over all crossings between the two links divided by 2. For components ...

Let Y^X be the set of continuous mappings f:X->Y. Then the topological space Y^X supplied with the compact-open topology is called a mapping space, and if X=I is taken as the ...