Search Results for ""

A collection of subsets of a topological space that is contained in a basis of the topology and can be completed to a basis when adding all finite intersections of the ...

A subset of an algebraic variety which is itself a variety. Every variety is a subvariety of itself; other subvarieties are called proper subvarieties. A sphere of the ...

A characterization of normal spaces with respect to the definition given by Kelley (1955, p. 112) or Willard (1970, p. 99). It states that the topological space X is normal ...

Oriented spheres in complex Euclidean three-space can be represented as lines in complex projective three-space ("Lie correspondence"), and the spheres may be thought of as ...

A vertex coloring is an assignment of labels or colors to each vertex of a graph such that no edge connects two identically colored vertices. A vertex coloring that minimize ...

A modified Miller's primality test which gives a guarantee of primality or compositeness. The algorithm's running time for a number n has been proved to be as ...

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

An algorithm for finding the nearest local minimum of a function which presupposes that the gradient of the function can be computed. The method of steepest descent, also ...

A subset is a portion of a set. B is a subset of A (written B subset= A) iff every member of B is a member of A. If B is a proper subset of A (i.e., a subset other than the ...

Connecting the centers of touching spheres in a three-dimensional Apollonian gasket by edges given a graph known as the Apollonian network. This process is illustrated above ...