Search Results for ""

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

For a measurable function mu, the Beltrami differential equation is given by f_(z^_)=muf_z, where f_z is a partial derivative and z^_ denotes the complex conjugate of z.

Let f:M->N be a geodesic mapping. If either M or N has constant curvature, then both surfaces have constant curvature (Ambartzumian 1982, p. 26; Kreyszig 1991).

The bend of a circle C mutually tangent to three other circles is defined as the signed curvature of C. If the contacts are all external, the signs of the bends of all four ...

A knot used to join the ends of two ropes together to form a longer length.

A matching is a maximum matching iff it contains no augmenting path.

A Bergman kernel is a function of a complex variable with the "reproducing kernel" property defined for any domain in which there exist nonzero analytic functions of class ...

An experiment in which s trials are made of an event, with probability p of success in any given trial.

Suppose the harmonic series converges to h: sum_(k=1)^infty1/k=h. Then rearranging the terms in the sum gives h-1=h, which is a contradiction.

The orthogonal polynomials on the interval [-1,1] associated with the weighting functions w(x) = (1-x^2)^(-1/2) (1) w(x) = (1-x^2)^(1/2) (2) w(x) = sqrt((1-x)/(1+x)), (3) ...