Analytic combinatorics is the study of counting sequences associated with discrete objects (e.g. integers and graphs) and understanding how fast those sequences grow. The course is broken into two components. First, generating functions will be use to encapsulate counting sequences and their recurrence structures with a formal power series. Second, analytic methods will be used to obtain the precise asymptotic behavior of counting sequences. The informal prerequisites are: familiarity with basic discrete math objects: sets, permutations, combinations, graphs; power series; mathematical maturity (e.g. the ability to write rigorous proofs and to absorb new definitions quickly). Formal prerequisites: Math 310 or CSE 240.
Course Attributes: AS NSM
Section 01Topics in Graph Theory
INSTRUCTOR: KneseView Course Listing