Search Results for ""

A die (plural "dice") is a solid with markings on each of its faces. The faces are usually all the same shape, making Platonic solids and Archimedean duals the obvious ...

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

In two dimensions, there are two periodic circle packings for identical circles: square lattice and hexagonal lattice. In 1940, Fejes Tóth proved that the hexagonal lattice ...

The term "integral" can refer to a number of different concepts in mathematics. The most common meaning is the the fundamenetal object of calculus corresponding to summing ...

A parabola (plural "parabolas"; Gray 1997, p. 45) is the set of all points in the plane equidistant from a given line L (the conic section directrix) and a given point F not ...

Expanding the Riemann zeta function about z=1 gives zeta(z)=1/(z-1)+sum_(n=0)^infty((-1)^n)/(n!)gamma_n(z-1)^n (1) (Havil 2003, p. 118), where the constants ...

A base-b BBP-type formula is a convergent series formula of the type alpha=sum_(k=0)^infty(p(k))/(b^kq(k)) (1) where p(k) and q(k) are integer polynomials in k (Bailey 2000; ...

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...

If two numbers b and c have the property that their difference b-c is integrally divisible by a number m (i.e., (b-c)/m is an integer), then b and c are said to be "congruent ...

Let A be an edge cut of a connected graph G. Then the cyclic edge connectivity lambda_c(G) is the size of a smallest cyclic edge cut, i.e., a smallest edge cut A such that ...