Search Results for ""

The quasirhombicuboctahedron is the name given by Wenninger (1989, p. 132) to the uniform polyhedron with Maeder index 17 (Maeder 1997), Wenninger index 85 (Wenninger 1989), ...

An unsolved problem in mathematics attributed to Lehmer (1933) that concerns the minimum Mahler measure M_1(P) for a univariate polynomial P(x) that is not a product of ...

A module over a ring that is contained in and has the same addition as another module over the same ring.

The Ackermann function is the simplest example of a well-defined total function which is computable but not primitive recursive, providing a counterexample to the belief in ...

The problem of packing a set of items into a number of bins such that the total weight, volume, etc. does not exceed some maximum value. A simple algorithm (the first-fit ...

A cograph (or "complement-reducible graph") is simple graph defined by the criteria 1. K_1 is a cograph, 2. If X is a cograph, then so is its graph complement, and 3. If X ...

A 4-state two-dimensional Turing machine invented in the 1980s. The ant starts out on a grid containing black and white cells, and then follows the following set of rules. 1. ...

Roughly speaking, a matroid is a finite set together with a generalization of a concept from linear algebra that satisfies a natural set of properties for that concept. For ...

Orthogonal circles are orthogonal curves, i.e., they cut one another at right angles. By the Pythagorean theorem, two circles of radii r_1 and r_2 whose centers are a ...

Let G be a graph, and suppose each edge of G is independently deleted with fixed probability 0<=p<=1. Then the probability that no connected component of G is disconnected as ...