Search Results for ""

A data structure designed to allow repeated extraction of the smallest remaining key (Skiena 1990, p. 38).

A random composition of a number n in k parts is one of the (n+k-1; n) possible compositions of n, where (n; k) is a binomial coefficient. A random composition can be given ...

A random partition of a number n is one of the P(n) possible partitions of n, where P(n) is the partition function P. A random partition can be given by RandomPartition[n] in ...

A Young tableau chosen at random from those having a given shape. A random tableau can be generated by RandomTableau[shape] in the Wolfram Language package Combinatorica` . ...

The term "snark" was first popularized by Gardner (1976) as a class of minimal cubic graphs with edge chromatic number 4 and certain connectivity requirements. (By Vizing's ...

sum_(k=-infty)^infty(a; m-k)(b; n-k)(a+b+k; k)=(a+n; m)(b+m; n).

When a Young tableau is constructed using the so-called insertion algorithm, an element starts in some position on the first row, from which it may later be bumped. In ...

A topological sort is a permutation p of the vertices of a graph such that an edge {i,j} implies that i appears before j in p (Skiena 1990, p. 208). Only acyclic digraphs can ...

An exchange of two elements of an ordered list with all others staying the same. A transposition is therefore a permutation of two elements. For example, the swapping of 2 ...

A weakly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...