Search Results for ""

The number 2^(1/3)=RadicalBox[2, 3] (the cube root of 2) which is to be constructed in the cube duplication problem. This number is not a Euclidean number although it is an ...

The Delsarte graph is a strongly regular graph on 243 vertices with regular parameters (nu,k,lambda,mu)=(243,110,37,60). It is distance-regular as well as distance-transitive ...

Given a set X, let F be a nonempty set of subsets of X. Then F is a ring if, for every pair of sets in F, the intersection, union, and set difference is also in F. F is ...

Amazingly, the catacaustic of the deltoid when the rays are parallel in any direction is an astroid. In particular, for a deltoid with parametric equations x = 2cost+cos(2t) ...

In continuum theory, a dendrite is a locally connected continuum that contains no simple closed curve. A semicircle is therefore a dendrite, while a triangle is not. The term ...

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

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