Math.Combinat.Sets

Subsets.

Documentation

choose :: Int -> [a] -> [[a]]

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

combine :: Int -> [a] -> [[a]]

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

tuplesFromList :: Int -> [a] -> [[a]]

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

 tuplesFromList k xs == listTensor (replicate k xs)

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

listTensor :: [[a]] -> [[a]]

"Tensor product" for lists.

kSublists :: Int -> [a] -> [[a]]

Sublists of a list having given number of elements.

sublists :: [a] -> [[a]]

All sublists of a list.

countKSublists :: Int -> Int -> Integer

# = binom { n } { k }.

countSublists :: Int -> Integer

# = 2^n.