Search Results for ""

A random permutation is a permutation containing a fixed number n of a random selection from a given set of elements. There are two main algorithms for constructing random ...

The Schwarz triangles are spherical triangles which, by repeated reflection in their indices, lead to a set of congruent spherical triangles covering the sphere a finite ...

A siteswap is a sequence encountered in juggling in which each term is a positive integer, encoded in binary. The transition rule from one term to the next consists of ...

Solid partitions are generalizations of plane partitions. MacMahon (1960) conjectured the generating function for the number of solid partitions was ...

Sorting is the rearrangement of numbers (or other orderable objects) in a list into their correct lexographic order. Alphabetization is therefore a form of sorting. Because ...

The distribution of a variable is a description of the relative numbers of times each possible outcome will occur in a number of trials. The function describing the ...

A Steiner system S(t,k,v) is a set X of v points, and a collection of subsets of X of size k (called blocks), such that any t points of X are in exactly one of the blocks. ...

The superfactorial of n is defined by Pickover (1995) as n$=n!^(n!^(·^(·^(·^(n!)))))_()_(n!). (1) The first two values are 1 and 4, but subsequently grow so rapidly that 3$ ...

The total domination number gamma_t of a graph is the size of a smallest total dominating set, where a total dominating set is a set of vertices of the graph such that all ...

A weak snark is a cyclically 4-edge connected cubic graph with edge chromatic number 4 and girth at least 4 (Brinkmann et al. 2013). Weak snarks therefore represent a more ...