Search Results for ""

Let P(G) denote the chromatic polynomial of a finite simple graph G. Then G is said to be chromatically unique if P(G)=P(H) implies that G and H are isomorphic graphs, in ...

Chrystal's identity is the algebraic identity ((b-c)^2+(b+c)^2+2(b^2-c^2))/((b^4-2b^2c^2+c^4)[1/((b-c)^2)+2/(b^2-c^2)+1/((b+c)^2)])=1 given as an exercise by Chrystal (1886).

The Chu-Vandermonde identity _2F_1(-n,b;c;1)=((c-b)_n)/((c)_n) (1) (for n in Z^+) is a special case of Gauss's hypergeometric theorem _2F_1(a,b;c;1) = ((c-b)_(-a))/((c)_(-a)) ...

A Chu space is a binary relation from a set A to an antiset X which is defined as a set which transforms via converse functions.

A gambling game played at carnivals in which a player may bet on any one of the numbers 1 through 6. Three dice are then rolled and, if his number appears, he receives back a ...

A reduction system is said to posses the Church-Rosser property if, for all x and y such that x<->_*y, there exists a z such that x->_*z and y->_*z. A reduction system is ...

The Church-Rosser theorem states that lambda calculus as a reduction system with lambda conversion rules satisfies the Church-Rosser property.

The Church-Turing thesis (formerly commonly known simply as Church's thesis) says that any real-world computation can be translated into an equivalent computation involving a ...

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

Grünbaum conjectured that for every m>1, n>2, there exists an m-regular, m-chromatic graph of girth at least n. This result is trivial for n=2 or m=2,3, but only a small ...