Search Results for ""

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 partitioning of a plane with n points into convex polygons such that each polygon contains exactly one generating point and every point in a given polygon is closer to ...

The integral transform obtained by defining omega=-tan(1/2delta), (1) and writing H(omega)=R(omega)+iX(omega), (2) where R(omega) and X(omega) are a Hilbert transform pair as ...

A nonparametric alternative to the two-sample t-test.

The entire function phi(rho,beta;z)=sum_(k=0)^infty(z^k)/(k!Gamma(rhok+beta)), where rho>-1 and beta in C, named after the British mathematician E. M. Wright.

The sequence {F_n-1} is complete even if restricted to subsequences which contain no two consecutive terms, where F_n is a Fibonacci number.

A zero-sum game is a game in which players make payments only to each other. In such a game, one player's loss is the other player's gain, so the total amount of "money" ...

A zero tensor is a tensor of any rank and with any pattern of covariant and contravariant indices all of whose components are equal to 0 (Weinberg 1972, p. 38).

sum_(y=0)^m(-1)^(m-y)q^((m-y; 2))[m; y]_q(1-wq^m)/(q-wq^y) ×(1-wq^y)^m(-(1-z)/(1-wq^y);q)_y=(1-z)^mq^((m; 2)), where [n; y]_q is a q-binomial coefficient.

The following integral transform relationship, known as the Abel transform, exists between two functions f(x) and g(t) for 0<alpha<1, f(x) = int_0^x(g(t)dt)/((x-t)^alpha) (1) ...