Title: Recurrences for Generating Polynomials
Speaker: Pawel Hitczenko, Drexel University
Date: Monday, April 4, 2016 2:00 pm
Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ
In the talk I will describe several recurrences for polynomials that I encountered recently. When interpreted in probabilistic language they are, after suitable normalization, generating polynomials of discrete random variables and thus are useful in studying properties of these random variables.
I will then discuss attempts (mostly unsatisfactory at this point) to extract general statement that would allow to draw conclusions about the asymptotic behavior of the underlying random variables from the form of the recurrences.
As an example of applications I will present some new results on tree-like tableaux, a combinatorial family introduced in 2011. Our results extend those of Laborde Zubieta, and also of Aval, Boussicault and Nadeau.
This is joint work with Amanda Lohss.
See: http://math.rutgers.edu/seminars/allseminars.php?sem_name=Discrete%20Math