Search Results for ""

1729 is sometimes called the Hardy-Ramanujan number. It is the smallest taxicab number, i.e., the smallest number which can be expressed as the sum of two cubes in two ...

Let x_0 be a rational number in the closed interval [0,1], and generate a sequence using the map x_(n+1)=2x_n (mod 1). (1) Then the number of periodic map orbits of period p ...

Vince and Bóna (2012) define an assembly tree T for a connected simple graph G on n nodes as a binary rooted tree with n leavesTree Leaf and n-1 internal nodes and satisfying ...

The associahedron is the n-dimensional generalization of the pentagon. It was discovered by Stasheff in 1963 and it is also known as the Stasheff polytope. The number of ...

Every irrational number x has an approximation constant c(x) defined by c(x)=lim inf_(q->infty)q|qx-p|, where p=nint(qx) is the nearest integer to qx and lim inf is the ...

A braid index is the least number of strings needed to make a closed braid representation of a link. The braid index is equal to the least number of Seifert circles in any ...

A description of an object by properties that are different from those mentioned in its definition, but are equivalent to them. The following list gives a number of examples. ...

The chromatic number of a graph G is the smallest number of colors needed to color the vertices of G so that no two adjacent vertices share the same color (Skiena 1990, p. ...

A notation used to describe curves. The fundamental principle of Clebsch-Aronhold notation states that if each of a number of forms be replaced by a power of a linear form in ...

A domatic partition is a partition of the vertices of a graph into disjoint dominating sets. The maximum number of disjoint dominating sets in a domatic partition of a graph ...