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

Doron Zeilberger, Rutgers University, zeilberg {at} math [dot] rutgers [dot] edu
Nathan Fox, Rutgers University, fox {at} math [dot] rutgers [dot] edu)

Title: Approximate Asymptotic Analysis of Combinatorial Sequences

Speaker: Jay Pantone, Dartmouth College

Date: Thursday, October 6, 2016 5:00pm

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


In enumerative combinatorics, it is quite common to have in hand a number of known initial terms of a combinatorial sequence whose behavior you'd like to study. In this talk we'll describe the Method of Differential Approximants, a technique that can be used to shed some light on the nature of a sequence using only some known initial terms. While these methods are, on the face of it, experimental, they often lead to rigorous proofs. We'll exhibit the usefulness of this method through a variety of combinatorial topics, including chord diagrams, permutation classes, and inversion sequences.

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