Search Results for ""

The function defined by T_n(x)=((-1)^(n-1))/(sqrt(n!))Z^((n-1))(x), where Z(x)=1/(sqrt(2pi))e^(-x^2/2) and Z^((k))(x) is the kth derivative of Z(x).

Except for triangles, every simple polygon has at least two nonoverlapping ears.

Let S be a set of simple polygonal obstacles in the plane, then the nodes of the visibility graph of S are just the vertices of S, and there is an edge (called a visibility ...

The statistical index P_W=(sumsqrt(q_0q_n)p_n)/(sumsqrt(q_0q_n)p_0), where p_n is the price per unit in period n and q_n is the quantity produced in period n.

The ordinary differential equation y^('')+1/2[1/(x-a_1)+1/(x-a_2)+1/(x-a_3)]y^' +1/4[(A_0+A_1x+A_2x^2)/((x-a_1)(x-a_2)(x-a_3))]y=0.

Let H=l^2, (alpha_n) be a bounded sequence of complex numbers, and (xi_n) be the (usual) standard orthonormal basis of H, that is, (xi_n)(m)=delta_(nm), n,m in N, where ...

The Wilcoxon test statistic is equivalent to the T_+ statistic in the Wilcoxon signed rank test (Kanji 1999).

The Woodbury formula (A+UV^(T))^(-1)=A^(-1)-[A^(-1)U(I+V^(T)A^(-1)U)^(-1)V^(T)A^(-1)] is a formula that allows a perturbed matrix to be computed for a change to a given ...

If k|n, then the complete k-uniform hypergraph on n vertices decomposes into 1-factors, where a 1-factor is a set of n/k pairwise disjoint k-sets. Brouwer and Schrijver ...

An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...