Notes for applied combinatorics, intended to supplement the book Applied Combinatorics by Keller and Trotter

Contains:

• An alternate proof of the Inclusion/Exclusion formula and a fully worked out proof of the Euler Totient formula
• Notes on the structure of permutations (cycles, inversions, signs)
• Notes on generating functions formalized through regular languages
• Notes on finite state automata and their connection to regular languages and generating functions

This work © 2024 by Sera Gunn is licensed under CC BY-SA 4.0