Search Results for ""

The most general form of this theorem states that in a commutative unit ring R, the height of every proper ideal I generated by n elements is at most n. Equality is attained ...

A generalization of the Wilcoxon rank sum test.

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

A theorem which plays a fundamental role in computer science because it is one of the main tools for showing that certain orderings on trees are well-founded. These orderings ...

The Kuen surface is a special case of Enneper's negative curvature surfaces which can be given parametrically by x = (2(cosu+usinu)sinv)/(1+u^2sin^2v) (1) = ...

The Kuhn-Tucker theorem is a theorem in nonlinear programming which states that if a regularity condition holds and f and the functions h_j are convex, then a solution ...

A statistic defined to improve the Kolmogorov-Smirnov test in the tails.

For every positive integer n, there exists a sphere which has exactly n lattice points on its surface. The sphere is given by the equation ...

A group of linear fractional transformations which transform the arguments of Kummer solutions to the hypergeometric differential equation into each other. Define A(z) = 1-z ...

The Kummer surfaces are a family of quartic surfaces given by the algebraic equation (x^2+y^2+z^2-mu^2w^2)^2-lambdapqrs=0, (1) where lambda=(3mu^2-1)/(3-mu^2), (2) p, q, r, ...