Friday, April 6, 2018 3:30 pm
-
3:30 pm
EDT (GMT -04:00)
Title: Generating Functions: Theory, Algorithms, and Applications
Speaker: | Stephen Melczer |
Affiliation: | University of Pennsylvania |
Room: | MC 5501 |
Abstract:
Generating functions are an invaluable tool in many areas of discrete mathematics and beyond. In this talk we examine generating functions from an algorithmic perspective: how much information can be obtained from a generating function in an automatic manner, and at what cost? Applications to lattice path enumeration, non-negativity proofs for rational functions, and queuing theory will be discussed.