Search Results for ""

The binary logarithm log_2x is the logarithm to base 2. The notation lgx is sometimes used to denote this function in number theoretic literature. However, because Russian ...

A block diagonal matrix, also called a diagonal block matrix, is a square diagonal matrix in which the diagonal elements are square matrices of any size (possibly even 1×1), ...

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

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

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

A bridgeless graph, also called an isthmus-free graph, is a graph that contains no graph bridges. Examples of bridgeless graphs include complete graphs on n>2 nodes, cycle ...

A bundle map is a map between bundles along with a compatible map between the base manifolds. Suppose p:X->M and q:Y->N are two bundles, then F:X->Y is a bundle map if there ...

Cantor dust is a fractal that can be constructed using string rewriting beginning with a cell [0] and iterating the rules {0->[0 0 0; 0 0 0; 0 0 0],1->[1 0 1; 0 0 0; 1 0 1]}. ...

A chamfered cube, also inaccurately called a truncated rhombic dodecahedron or more accurately called a tetratruncated rhombic dodecahedron, is a polyhedron obtained by ...

A chamfered dodecahedron, inaccurately called a truncated rhombic triacontahedron or more accurately called a pentatruncated rhombic triacontahedron, is a polyhedron obtained ...