Search Results for ""

A Julia set with constant c chosen at the boundary of the Mandelbrot set (Branner 1989; Dufner et al. 1998, p. 225). The image above was computed using c=i.

A set A in a first-countable space is dense in B if B=A union L, where L is the set of limit points of A. For example, the rational numbers are dense in the reals. In ...

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 ...

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 total angular defect is the sum of the angular defects over all polyhedron vertices of a polyhedron, where the angular defect delta at a given polyhedron vertex is the ...

The descending chain condition, commonly abbreviated "D.C.C.," is the dual notion of the ascending chain condition. The descending chain condition for a partially ordered set ...

7 7 6 6 3 1; 6 5 4 2 ; 3 3 ; 2 A descending plane partition of order n is a two-dimensional array (possibly empty) of positive integers less than or equal to n such that the ...

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