Search Results for ""

An elegant algorithm for constructing an Eulerian cycle (Skiena 1990, p. 193).

A graph G is said to be flexible if the vertices of G can be moved continuously so that (1) the distances between adjacent vertices are unchanged, and (2) at least two ...

Let f:R×R->R be a one-parameter family of C^3 maps satisfying f(0,0) = 0 (1) [(partialf)/(partialx)]_(mu=0,x=0) = -1 (2) [(partial^2f)/(partialx^2)]_(mu=0,x=0) < 0 (3) ...

An action with G=R. Flows are generated by vector fields and vice versa.

Newton's term for a variable in his method of fluxions (differential calculus).

"Fluxion" is the term for derivative in Newton's calculus, generally denoted with a raised dot, e.g., f^.. The "d-ism" of Leibniz's df/dt eventually won the notation battle ...

A 180 degrees rotation of a tangle. The word "flype" is derived from the old Scottish verb meaning "to turn or fold back." Tait (1898) used this word to indicate a different ...

The distance p (sometimes also denoted k) from the focus to the conic section directrix of a conic section. The following table gives the focal parameter for the different ...

A catastrophe which can occur for one control factor and one behavior axis. It is the universal unfolding of the singularity f(x)=x^3 and has the equation F(x,u)=x^3+ux.

If a proposition P is true for all B, this is written P forall B. forall is one of the two so-called quantifiers, and translates the universal quantifier forall . The Wolfram ...