Search Results for ""

The Hajós number h(G) of a graph G is the maximum k such that G contains a subdivision of the complete graph K_k.

The study, first developed by Boole, of shift-invariant operators which are polynomials in the differential operator D^~. Heaviside calculus can be used to solve any ordinary ...

Lagrange's continued fraction theorem, proved by Lagrange in 1770, states that any positive quadratic surd sqrt(a) has a regular continued fraction which is periodic after ...

A discrete distribution of a random variable such that every possible value can be represented in the form a+bn, where a,b!=0 and n is an integer.

The least number of crossings that occur in any projection of a link. In general, it is difficult to find the crossing number of a given link. Knots and links are generally ...

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

A simplicial complex K is said to be locally finite if each vertex of K belongs only to finitely many simplices of K.

A quartic surface named after its resemblance to the liturgical headdress worn by bishops and given by the equation 4x^2(x^2+y^2+z^2)-y^2(1-y^2-z^2)=0.

Monster-barring is a term coined by Lakatos (1976) to refer to the refining of a hypothesis to rule out nasty counterexamples (Bailey et al. 2007, p. 11).

The illusion illustrated above in which the bounding rectangle and inner square both appear distorted.