Sponsored by the Rutgers University Department of Mathematics and the
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)

Brian Nakamura, Rutgers University, bnaka {at} math [dot] rutgers [dot] edu
Doron Zeilberger, Rutgers University, zeilberg {at} math [dot] rutgers [dot] edu

Title: Polynomial Versions of Integer Partitions and Their Zeros

Speaker: Robert Boyer, Drexel University

Date: Thursday, February 9, 2012 5:00pm

Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ


We discuss polynomial versions of different integer partition statistics; for example, the polynomial version of the partition numbers p(n) is the sum of pk(n) xk from k=1 to k=n, where pk(n) is the number of partitions of n with exactly k parts. The structure of their asymptotics has the striking visual consequence that the polynomial zeros approach a network of curves inside the unit disk which allow a complete description. Other examples include partitions with odd parts and plane partitions.

See: http://www.math.rutgers.edu/~bnaka/expmath/