Search Results for ""

A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...

The Bombieri p-norm of a polynomial Q(x)=sum_(i=0)^na_ix^i (1) is defined by [Q]_p=[sum_(i=0)^n(n; i)^(1-p)|a_i|^p]^(1/p), (2) where (n; i) is a binomial coefficient. The ...

An algorithm which can be used to find a good, but not necessarily minimal, edge or vertex coloring for a graph. However, the algorithm does minimally color complete ...

A Tschirnhausen transformation can be used to take a general quintic equation to the form x^5-x-a=0, where a may be complex.

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 theorem about (or providing an equivalent definition of) compact sets, originally due to Georg Cantor. Given a decreasing sequence of bounded nonempty closed sets C_1 ...

The only nonassociative division algebra with real scalars. There is an 8-square identity corresponding to this algebra. The elements of a Cayley algebra are called Cayley ...

A chamfered cube, also inaccurately called a truncated rhombic dodecahedron or more accurately called a tetratruncated rhombic dodecahedron, is a polyhedron obtained by ...

Let A be a commutative complex Banach algebra. A nonzero homomorphism from A onto the field of complex numbers is called a character. Every character is automatically ...

A characteristic factor is a factor in a particular factorization of the totient function phi(n) such that the product of characteristic factors gives the representation of a ...