Search Results for ""

Triangulation is the division of a surface or plane polygon into a set of triangles, usually with the restriction that each triangle side is entirely shared by two adjacent ...

Let A={A_1,A_2,...,A_n} be a union-closed set, then the union-closed set conjecture states that an element exists which belongs to at least n/2 of the sets in A. Sarvate and ...

An idealized coin consists of a circular disk of zero thickness which, when thrown in the air and allowed to fall, will rest with either side face up ("heads" H or "tails" T) ...

The Harborth graph is the smallest known 4-regular matchstick graph. It is therefore both planar and unit-distance. It has 104 edges and 52 vertices. This graph was named ...

A roulette is a curve traced by a fixed point on a closed convex curve as that curve rolls without slipping along a second curve. The roulettes described by the foci of ...

An alkane graph is a tree in which vertices correspond to atoms and edges to carbon-carbon or hydrogen-carbon bonds in a chemical alkane. In chemistry, an alkane is an ...

First stated in 1924, the Banach-Tarski paradox states that it is possible to decompose a ball into six pieces which can be reassembled by rigid motions to form two balls of ...

A Banach space is a complete vector space B with a norm ||·||. Two norms ||·||_((1)) and ||·||_((2)) are called equivalent if they give the same topology, which is equivalent ...

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

Borsuk conjectured that it is possible to cut an n-dimensional shape of generalized diameter 1 into n+1 pieces each with diameter smaller than the original. It is true for ...