Twelvefold way

From Wiki @ Karl Jones dot com
Jump to: navigation, search

In combinatorics, the twelvefold way is a name given to a systematic classification of twelve related enumerative problems concerning two finite sets, which include the classical problems of counting permutations, combinations, multisets, and partitions either of a set or of a number.

The idea of the classification is credited to Gian-Carlo Rota, and the name was suggested by Joel Spencer.

See also

External links