Search Results for ""

The Hamming graph H(d,q), sometimes also denoted q^d, is the graph Cartesian product of d copies of the complete graph K_q. H(d,q) therefore has q^d vertices. H(d,q) has ...

Any link can be represented by a closed braid.

The number of empty neighbors of a cluster.

A graph cycle.

e is transcendental.

The double-struck capital letter I, I, is a symbol sometimes used instead of Z for the ring of integers. In contrast, the lower case symbol i is used to refer to the ...

Definitions about a set which depend on the entire set.

The appropriate notion of integer for surreal numbers.

A sum over all cluster perimeters.

The unknot, also called the trivial knot (Rolfsen 1976, p. 51), is a closed loop that is not knotted. In the 1930s Reidemeister first proved that knots exist which are ...