Search Results for ""

Tracing through the connections of a branchial graph gives rise to the notion of a kind of space in which states on different branches of history are laid out. In particular, ...

Let B={b_1,b_2,...} be an infinite Abelian semigroup with linear order b_1<b_2<... such that b_1 is the unit element and a<b implies ac<bc for a,b,c in B. Define a Möbius ...

In 1850, Bravais demonstrated that crystals were comprised of 14 different types of unit cells: simple cubic, body-centered cubic, face-centered cubic; simple tetragonal, ...

An algorithm which can be used to find a good, but not necessarily minimal, edge or vertex coloring for a graph. However, the algorithm does minimally color complete ...

The Brent-Salamin formula, also called the Gauss-Salamin formula or Salamin formula, is a formula that uses the arithmetic-geometric mean to compute pi. It has quadratic ...

The second part of Pollard rho factorization method concerns detection of the fact that a sequence has become periodic. Pollard's original suggestion was to use the idea ...

Brent's method is a root-finding algorithm which combines root bracketing, bisection, and inverse quadratic interpolation. It is sometimes known as the van ...

An n-bridge knot is a knot with bridge number n. The set of 2-bridge knots is identical to the set of rational knots. If L is a 2-bridge knot, then the BLM/Ho polynomial Q ...

The least number of unknotted arcs lying above the plane in any projection. The knot 05-002 has bridge number 2. Such knots are called 2-bridge knots. There is a one-to-one ...

A bridged graph is a graph that contains one or more graph bridges. Examples of bridged graphs include path graphs, ladder rung graphs, the bull graph, star graphs, and ...