Search Results for ""

1 1 2 2 3 5 5 7 10 15 15 20 27 37 52 The Bell triangle, also called Aitken's array or the Peirce triangle (Knuth 2005, p. 28), is the number triangle obtained by beginning ...

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

The bellows conjecture asserts that all flexible polyhedra keep a constant volume as they are flexed (Cromwell 1997). The conjecture was apparently proposed by Dennis ...

A Belphegor number (also known as a Beelphegor number or a beastly palindromic prime) is a palindromic number of the form 1(0...)666(0...)1. Numbers of this form are named ...

A Belphegor prime (also known as a Beelphegor prime) is a prime Belphegor number, i.e., a palindromic prime of the form 1(0...)666(0...)1. The first few Belphegor primes are ...

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.

A vector field u satisfying the vector identity ux(del xu)=0 where AxB is the cross product and del xA is the curl is said to be a Beltrami field.

An identity in calculus of variations discovered in 1868 by Beltrami. The Euler-Lagrange differential equation is (partialf)/(partialy)-d/(dx)((partialf)/(partialy_x))=0. (1) ...

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