Search Results for ""

A set is denumerable iff it is equipollent to the finite ordinal numbers. (Moore 1982, p. 6; Rubin 1967, p. 107; Suppes 1972, pp. 151-152). However, Ciesielski (1997, p. 64) ...

A search algorithm of a tree that explores the first child of a node before visiting its siblings. Tarjan (1972) and Hopcroft and Tarjan (1973) showed that depth-first search ...

Given a polygon with an even number of sides, the derived polygon is obtained by joining the points which are a fractional distance r along each side. If r=1/2, then the ...

Togliatti surfaces are quintic surfaces having the maximum possible number of ordinary double points (31). A related surface sometimes known as the dervish can be defined by ...

The Descartes snarks are a set of snarks on 210 vertices and 315 edges discovered by William Tutte in 1948 writing under the pseudonym Blanche Descartes (Descartes 1948; ...

The study of designs and, in particular, necessary and sufficient conditions for the existence of a block design.

Let Delta_1, Delta_2, and Delta_3 be tetrahedra in projective three-space P^3. Then the tetrahedra are said to be desmically related if there exist constants alpha, beta, and ...

A useful determinant identity allows the following determinant to be expressed using vector operations, |x_1 y_1 z_1 1; x_2 y_2 z_2 1; x_3 y_3 z_3 1; x_4 y_4 z_4 ...

A Turing machine is called deterministic if there is always at most one instruction associated with a given present internal state/tape state pair (q,s). Otherwise, it is ...

Consider the length of the diagonal of a unit square as approximated by piecewise linear steps that may only be taken in the right and up directions. Obviously, the length so ...