Search Results for ""

The converse of Pascal's theorem, which states that if the three pairs of opposite sides of (an irregular) hexagon meet at three collinear points, then the six vertices lie ...

The algorithm for the construction of a Gröbner basis from an arbitrary ideal basis. Buchberger's algorithm relies on the concepts of S-polynomial and polynomial reduction ...

A tree (also called a central tree) having a single node that is a graph center. The numbers of centered trees on n=1, 2, ... nodes are 1, 0, 1, 1, 2, 3, 7, 12, 27, 55, 127, ...

Church proved several important theorems that now go by the name Church's theorem. One of Church's theorems states that there is no consistent decidable extension of Peano ...

Clark's triangle is a number triangle created by setting the vertex equal to 0, filling one diagonal with 1s, the other diagonal with multiples of an integer f, and filling ...

The term "closure" has various meanings in mathematics. The topological closure of a subset A of a topological space X is the smallest closed subset of X containing A. If R ...

If the four points making up a quadrilateral are joined pairwise by six distinct lines, a figure known as a complete quadrangle results. A complete quadrangle is therefore a ...

A labeled ternary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2, 3, 4, branches from these leading to 5, 6, 7 and 8, 9, 10 respectively, ...

A measure which takes values in the complex numbers. The set of complex measures on a measure space X forms a vector space. Note that this is not the case for the more common ...

The composite number problem asks if for a given positive integer N there exist positive integers m and n such that N=mn. The complexity of the composite number problem was ...