Search Results for ""

A two-coloring of a complete graph K_n of n nodes which contains exactly the number of monochromatic forced triangles and no more (i.e., a minimum of R+B where R and B are ...

A graceful graph is a graph that can be gracefully labeled. Special cases of graceful graphs include the utility graph K_(2,3) (Gardner 1983) and Petersen graph. A graph that ...

"The" Griffiths point Gr is the fixed point in Griffiths' theorem. Given four points on a circle and a line through the center of the circle, the four corresponding Griffiths ...

Let sigma(n) be the divisor function. Then lim sup_(n->infty)(sigma(n))/(nlnlnn)=e^gamma, where gamma is the Euler-Mascheroni constant. Ramanujan independently discovered a ...

Define psi(x)={1 0<=x<1/2; -1 1/2<x<=1; 0 otherwise (1) and psi_(jk)(x)=psi(2^jx-k) (2) for j a nonnegative integer and 0<=k<=2^j-1. So, for example, the first few values of ...

A Hadamard matrix is a type of square (-1,1)-matrix invented by Sylvester (1867) under the name of anallagmatic pavement, 26 years before Hadamard (1893) considered them. In ...

There are two types of functions known as Hankel functions. The more common one is a complex function (also called a Bessel function of the third kind, or Weber Function) ...

Informally, self-similar objects with parameters N and s are described by a power law such as N=s^d, where d=(lnN)/(lns) is the "dimension" of the scaling law, known as the ...

The Heine-Borel theorem states that a subspace of R^n (with the usual topology) is compact iff it is closed and bounded. The Heine-Borel theorem can be proved using the ...

A flexagon made by folding a strip into adjacent equilateral triangles. The number of states possible in a hexaflexagon is the Catalan number C_5=42.