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: Riordan Arrays and Their Applications in Combinatoric

Speaker: Melkamu Zeleke, William Paterson University

Date: Thursday, April 19, 2012 5:00pm

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


The use of Riordan arrays in combinatorics has gained some attention after the publication of the seminal paper titled "The Riordan Group" by L.W. Shapiro, S. Getu, W.J. Woan, and L.C. Woodson in the early 1990s. In this talk, we use the Lagrange Inversion Theorem for formal power series as a motivation to introduce the Riordan arrays. We will then look at the fundamental properties of Riordan arrays, and apply some of these properties to binomial and inverse identities, and enumeration of combinatorial objects.

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