Search Results for ""

A bijective map between two metric spaces that preserves distances, i.e., d(f(x),f(y))=d(x,y), where f is the map and d(a,b) is the distance function. Isometries are ...

A theorem in the theory of univalent conformal mappings of families of domains on a Riemann surface, containing an inequality for the coefficients of the mapping functions, ...

Knuth's series is given by S = sum_(k=1)^(infty)((k^k)/(k!e^k)-1/(sqrt(2pik))) (1) = -2/3-1/(sqrt(2pi))zeta(1/2) (2) = -0.08406950872765599646... (3) (OEIS A096616), where ...

Levenberg-Marquardt is a popular alternative to the Gauss-Newton method of finding the minimum of a function F(x) that is a sum of squares of nonlinear functions, ...

The Longuet-Higgins circle is the radical circle of the circles centered at the vertices A, B, and C of a reference triangle with respective radii b+c, c+a, and a+b. Its ...

The function defined by y=ks^xb^(q^x) which is used in actuarial science for specifying a simplified mortality law (Kenney and Keeping 1962, pp. 241-242). Using s(x) as the ...

The word "median" has several different meanings in mathematics all related to the "middle" of mathematical objects. The statistical median is an order statistic that gives ...

Mergelyan's theorem can be stated as follows (Krantz 1999). Let K subset= C be compact and suppose C^*\K has only finitely many connected components. If f in C(K) is ...

A nonnegative function g(x,y) describing the "distance" between neighboring points for a given set. A metric satisfies the triangle inequality g(x,y)+g(y,z)>=g(x,z) (1) and ...

A minimum edge cut of a graph is an edge cut of smallest possible size. The size of a minimum edge cut in a connected graph G is called the graph's edge connectivity ...