Search Results for ""

An outcome is a subset of a probability space. Experimental outcomes are not uniquely determined from the description of an experiment, and must be agreed upon to avoid ...

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 Sierpiński gasket graph of order n is the graph obtained from the connectivity of the Sierpiński sieve. The first few Sierpiński gasket graphs are illustrated above. S_2 ...

A test for determining the probability that a given result could not have occurred by chance (its significance).

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 ...