Search Results for ""

A set A of integers is recursively isomorphic to set B if there is a bijective recursive function f such that f(A)=B.

The sequency k of a Walsh function is defined as half the number of zero crossings in the time base.

The property intf(y)delta(x-y)dy=f(x) obeyed by the delta function delta(x).

The study of valuations which simplifies class field theory and the theory of function fields.

delta(x-t)=sum_(n=0)^inftyphi_n(x)phi_n(t), where delta(x) is the delta function.

A global maximum, also known as an absolute maximum, the largest overall value of a set, function, etc., over its entire range. It is impossible to construct an algorithm ...

A global minimum, also known as an absolute minimum, is the smallest overall value of a set, function, etc., over its entire range. It is impossible to construct an algorithm ...

Every graph with n vertices and maximum vertex degree Delta(G)<=k is (k+1)-colorable with all color classes of size |_n/(k+1)_| or [n/(k+1)], where |_x_| is the floor ...

A root-finding algorithm also called Bailey's method and Hutton's method. For a function of the form g(x)=x^d-r, Lambert's method gives an iteration function ...

Let f:R->R, then the negative part of f is the function f^-:R->R defined by f^-(x)=max(-f(x),0). Note that the negative part is itself a nonnegative function. The negative ...