Search Results for ""

A sorting algorithm which makes n passes over a set of n elements, in each pass selecting the smallest element and deleting it from the set. This algorithm has running time ...

A triangle that is equal to its polar triangle with respect to a given conic is said to be self-polar with respect to that conic. Any triangle is self-polar with respect to ...

The metric tensor g on a smooth manifold M=(M,g) is said to be semi-Riemannian if the index of g is nonzero. In nearly all literature, the term semi-Riemannian is used ...

A semimagic square is a square that fails to be a magic square only because one or both of the main diagonal sums do not equal the magic constant (Kraitchik 1942, p. 143). ...

A set S and a binary operator * are said to exhibit closure if applying the binary operator to two elements S returns a value which is itself a member of S. The closure of a ...

The locus of the similitude center of two circles.

Given a set P with |P|=p elements consisting of c_1 numbers 1, c_2 numbers 2, ..., and c_n numbers n and c_1+c_2+...+c_n=p, find the number of permutations with k-1 rises ...

A simple function is a finite sum sum_(i)a_ichi_(A_i), where the functions chi_(A_i) are characteristic functions on a set A. Another description of a simple function is a ...

A small circle is a spheric section that does not contain a diameter of the sphere (Kern and Bland 1948, p. 87; Tietze 1965, p. 25).

A spanning tree of a graph on n vertices is a subset of n-1 edges that form a tree (Skiena 1990, p. 227). For example, the spanning trees of the cycle graph C_4, diamond ...