Search Results for ""

A generalization of the Runge-Kutta method for solution of ordinary differential equations, also called Kaps-Rentrop methods.

An n-route is defined as a walk of length n with specified initial point in which no line succeeds itself.

Rubik's graph is the Cayley graph of Rubik's group. The graph diameter of this graph is sometimes known as God's number, and was shown in Aug. 2010 to be equal to 20 (Rokicki ...

A straightedge with markings to indicate distances. Although geometric constructions are sometimes said to be performed with a ruler and compass, the term straightedge is ...

In order for a band-limited (i.e., one with a zero power spectrum for frequencies nu>B) baseband (nu>0) signal to be reconstructed fully, it must be sampled at a rate nu>=2B. ...

A linkage which converts circular to linear motion using a hinged square.

Deciding whether a given Boolean formula in conjunctive normal form has an assignment that makes the formula "true." In 1971, Cook showed that the problem is NP-complete.

A low-pass filter which is useful for smoothing data.

A correspondence between a permutation and a pair of Young tableaux.

A planar graph corresponding to polyhedra skeletons. The polyhedral graphs are special cases.