Combinatorics (Fall 2010)/Basic enumeration: Difference between revisions

From TCS Wiki
Jump to navigation Jump to search
No edit summary
Line 1: Line 1:
== Counting Problems ==
== Counting Problems ==
== Permutations ==


== Sets and Multisets ==
== Sets and Multisets ==


== Permutations ==


== The twelvfold way ==
== The twelvfold way ==

Revision as of 01:26, 9 July 2010

Counting Problems

Permutations

Sets and Multisets

The twelvfold way

f:NM

Elements of N Elements of M Any f Injective (1-1) f Surjective (on-to) f
distinguishable distinguishable mn (m)n m!S(n,m)
indistinguishable distinguishable ((mn)) (mn) ((mnm))
distinguishable indistinguishable k=1mS(n,k) {1if nm0if n>m S(n,m)
indistinguishable indistinguishable k=1mpk(n) {1if nm0if n>m pm(n)