Counting Surjections in Combinatorics

Given two finite sets, we might wonder how many surjections exist that map from one to the other. It turns out that this question, and a generalization, can be answered using the principle of inclusion-exclusion (PIE). Moreover, if the output codomain has more elements than the input domain, then the number of surjections is zero, which results in a combinatorial identity.