Search Results for ""

A Skolem sequence of order n is a sequence S={s_1,s_2,...,s_(2n)} of 2n integers such that 1. For every k in {1,2,...,n}, there exist exactly two elements s_i,s_j in S such ...

The small world problem asks for the probability that two people picked at random have at least one acquaintance in common.

A roll of two 1s (the lowest roll possible) on a pair of six-sided dice. The probability of rolling snake eyes is 1/36, or 2.777...%.

Let A and B be two *-algebras. An algebraic homomorphism phi:A->B is called *-homomorphism if it satisfies phi(a^*)=phi(a)^* for each a in A.

A 3-coloring of graph edges so that no two edges of the same color meet at a graph vertex (Ball and Coxeter 1987, pp. 265-266).

Asserts the existence and uniqueness of the extremal quasiconformal map between two compact Riemann surfaces of the same genus modulo an equivalence relation.

The sequence {F_n-1} is complete even if restricted to subsequences which contain no two consecutive terms, where F_n is a Fibonacci number.

A k-partite graph is a graph whose graph vertices can be partitioned into k disjoint sets so that no two vertices within the same set are adjacent.

The plane figure formed by a sequence of circles C_1, C_2, C_3, ... that are all tangent to each other at the same point and such that the sequence of radii converges to ...

A principal bundle is a special case of a fiber bundle where the fiber is a group G. More specifically, G is usually a Lie group. A principal bundle is a total space E along ...