Search Results for ""

A Brauer chain is an addition chain in which each member uses the previous member as an addend. A number n for which a shortest chain exists which is a Brauer chain is called ...

A number n for which a shortest chain exists which is a Brauer chain is called a Brauer number. There are infinitely many non-Brauer numbers.

A search algorithm of a graph which explores all nodes adjacent to the current node before moving on. For cyclic graphs, care must be taken to make sure that no nodes are ...

A numerical knot invariant. For a tame knot K, the bridge index is the least bridge number of all planar representations of the knot. The bridge index of the unknot is ...

The inverse of the Laplace transform, given by F(t)=1/(2pii)int_(gamma-iinfty)^(gamma+iinfty)e^(st)f(s)ds, where gamma is a vertical contour in the complex plane chosen so ...

The Bron-Kerbosch algorithm is an efficient method for finding all maximal cliques in a graph.

For every positive integer n, there exists a square in the plane with exactly n lattice points in its interior. This was extended by Schinzel and Kulikowski to all plane ...

A section of a fiber bundle gives an element of the fiber over every point in B. Usually it is described as a map s:B->E such that pi degreess is the identity on B. A ...

The 6-polyiamond illustrated above.

Any n-dimensional Riemannian manifold can be locally embedded into an (n+1)-dimensional manifold with Ricci curvature Tensor R_(ab)=0. A similar version of the theorem for a ...