Search Results for ""

The 4-polyhex illustrated above.

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

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.

The operator B^~ defined by B^~f(z)=int_D((1-|z|^2)^2)/(|1-zw^_|^4)f(w)dA(w) for z in D, where D is the unit open disk and w^_ is the complex conjugate (Hedenmalm et al. ...

Let M be a compact n-dimensional manifold with injectivity radius inj(M). Then Vol(M)>=(c_ninj(M))/pi, with equality iff M is isometric to the standard round sphere S^n with ...

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

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