Search Results for ""

The integral transform (Kf)(x)=int_0^inftysqrt(xt)K_nu(xt)f(t)dt, where K_nu(x) is a modified Bessel function of the second kind. Note the lower limit of 0, not -infty as ...

If a compact manifold M has nonnegative Ricci curvature tensor, then its fundamental group has at most polynomial growth. On the other hand, if M has negative curvature, then ...

A minimum dominating set is a dominating set of smallest size in a given graph. The size of a minimum dominating set is known as the domination number of the graph. A minimum ...

The Minkowski measure of a bounded, closed set is the same as its Lebesgue measure.

Always decreasing; never remaining constant or increasing. Also called strictly decreasing.

A multiple root is a root with multiplicity n>=2, also called a multiple point or repeated root. For example, in the equation (x-1)^2=0, 1 is multiple (double) root. If a ...

A problem is NP-hard if an algorithm for solving it can be translated into one for solving any NP-problem (nondeterministic polynomial time) problem. NP-hard therefore means ...

A branch of mathematics which attempts to formalize the nature of the set using a minimal collection of independent axioms. Unfortunately, as discovered by its earliest ...

The second-order ordinary differential equation satisfied by the Neumann polynomials O_n(x).

Neville's algorithm is an interpolation algorithm which proceeds by first fitting a polynomial of degree 0 through the point (x_k,y_k) for k=1, ..., n, i.e., P_k(x)=y_k. A ...