All possible ways to choose k elements from a list, without repetitions. "Antisymmetric power" for lists. Synonym for kSublists.

choose_ k n returns all possible ways of choosing k disjoint elements from [1..n]

 choose_ k n == choose k [1..n]

All possible ways to choose k elements from a list, with repetitions. "Symmetric power" for lists. See also Math.Combinat.Compositions. TODO: better name?

A synonym for combine.

"Tensor power" for lists. Special case of listTensor:

 tuplesFromList k xs == listTensor (replicate k xs)

See also Math.Combinat.Tuples. TODO: better name?

"Tensor product" for lists.

Sublists of a list having given number of elements.

All sublists of a list.

# = binom { n } { k }.

# = 2^n.

randomChoice k n returns a uniformly random choice of k elements from the set [1..n]

Example:

 do
   cs <- replicateM 10000 (getStdRandom (randomChoice 3 7))
   mapM_ print $ histogram cs