Search Results for ""

Baxter's four-coloring constant for a triangular lattice is given by C^2 = product_(j=1)^(infty)((3j-1)^2)/((3j-2)(3j)) (1) = 3/(4pi^2)Gamma^3(1/3) (2) = 1.46099848... (3) ...

A shuffling algorithm used in a class of random number generators.

For P, Q, R, and S polynomials in n variables [P·Q,R·S]=sum_(i_1,...,i_n>=0)A/(i_1!...i_n!), (1) where A=[R^((i_1,...,i_n))(D_1,...,D_n)Q(x_1,...,x_n) ...

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

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.

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