Search Results for ""

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

Let each sphere in a sphere packing expand uniformly until it touches its neighbors on flat faces. Call the resulting polyhedron the local cell. Then the local density is ...

The (first) rhombic dodecahedron is the dual polyhedron of the cuboctahedron A_1 (Holden 1971, p. 55) and Wenninger dual W_(11). Its sometimes also called the rhomboidal ...

A deltahedron is a polyhedron whose faces are congruent equilateral triangles (Wells 1986, p. 73). Note that polyhedra whose faces could be triangulated so as to be composed ...

The elongated square gyrobicupola nonuniform polyhedron obtained by rotating the bottom third of a small rhombicuboctahedron (Ball and Coxeter 1987, p. 137). It is also ...

Given a map with genus g>0, Heawood showed in 1890 that the maximum number N_u of colors necessary to color a map (the chromatic number) on an unbounded surface is N_u = ...

An algorithm which allows digits of a given number to be calculated without requiring the computation of earlier digits. The BBP formula for pi is the best-known such ...

The snub dodecahedron is an Archimedean solid consisting of 92 faces (80 triangular, 12 pentagonal), 150 edges, and 60 vertices. It is sometimes called the dodecahedron simum ...

The cubitruncated cuboctahedral graph is the skeleton of the cubitruncated cuboctahedron, which is the only uniform polyhedron for which this is the case. It is illustrated ...

There are several closely related results that are variously known as the binomial theorem depending on the source. Even more confusingly a number of these (and other) ...