Search Results for ""

Eliminate each knot crossing by connecting each of the strands coming into the crossing to the adjacent strand leaving the crossing. The resulting strands no longer cross but ...

The number of operations needed to effect a geometric construction as determined in geometrography. If the number of operations of the five geometrographic types are denoted ...

The Reidemeister move of type III.

A graphical partitioning based on the eigenvalues and eigenvectors of the Laplacian matrix of a graph.

The term cube is used in topology to denote the Cartesian product of any (finite or infinite) number of copies of the closed interval [0,1] equipped with the product topology ...

A topological sort is a permutation p of the vertices of a graph such that an edge {i,j} implies that i appears before j in p (Skiena 1990, p. 208). Only acyclic digraphs can ...

A projection of a link is tricolorable if each of the strands in the projection can be colored in one of three different colors such that, at each crossing, all three colors ...

To truncate a real number is to discard its noninteger part. Truncation of a (positive) number x therefore corresponds to taking the floor function |_x_|. Truncation also ...

Let S be a nonempty set, then an ultrafilter on S is a nonempty collection F of subsets of S having the following properties: 1. emptyset not in F. 2. If A,B in F, then A ...

The substitution of x=w-p/(3w) (1) into the standard form cubic equation x^3+px=q. (2) The result reduces the cubic to the equation w^3-(p^3)/(27w^3)-q=0, (3) which is easily ...