Search Results for ""

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

An algorithm originally described by Barnsley in 1988. Pick a point at random inside a regular n-gon. Then draw the next point a fraction r of the distance between it and a ...

The Danzer configuration is a 35_4 self-dual configuration of 35 lines and 35 points in which 4 points lie on each line and 4 lines pass through each point. The Levi graph of ...

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

The direct limit, also called a colimit, of a family of R-modules is the dual notion of an inverse limit and is characterized by the following mapping property. For a ...

A subset G subset R of the real numbers is said to be a G_delta set provided G is the countable intersection of open sets. The name G_delta comes from German: The G stands ...

The inverse limit of a family of R-modules is the dual notion of a direct limit and is characterized by the following mapping property. For a directed set I and a family of ...

The sphere with respect to which inverse points are computed (i.e., with respect to which geometrical inversion is performed). For example, the cyclides are inversions in a ...

The pentagrammic antiprism is the uniform polyhedron with Maeder index 79 (Maeder 1997), Coxeter index 34 (Coxeter et al. 1954), and Har'El index 4 (Har'El 1993). It will be ...

The pentagrammic crossed antiprism is the uniform polyhedron with Maeder index 80 (Maeder 1997), Coxeter index 35 (Coxeter et al. 1954), and Har'El index 5 (Har'El 1993). It ...