Two famous examples in Enumerative Combinatorics

Bennet Goeckner
University of San Diego

Enumerative combinatorics is often called the art or science of counting. We will give a preview of this field by investigating two famous examples: The Catalan numbers and the Fibonacci sequence. We will show how two of the most prevalent and powerful techniques from this area -- bijections and generating functions -- can be used to understand these examples.


Back to Practicum for Undergraduate Mathematicians in Combinatorics