Mathematics 690STC - Generating Functions
Spring
2024
01
3.00
Paul Gunnells
M W 8:40AM 9:55AM
UMass Amherst
20418
Lederle Grad Res Tower rm 1322
gunnells@math.umass.edu
Generating functions are a basic counting technique in combinatorics with many applications to different fields, including geometry, number theory, and representation theory. This course will be a fast-paced introduction to the subject with an emphasis on examples. Topics will include ordinary and exponential generating functions, rational generating functions, algebraic generating functions, combinatorics of gaussian integrals and matrix models, and applications to counting graphs, hypergraphs, and maps on surfaces.
PreReq: MATH 611 Pre-requisite is Math 611 or permission of instructor.