Sponsored by the Rutgers University Department of Mathematics and the

Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)

**Co-organizers:****Andrew Baxter**, Rutgers University, baxter{at} math [dot] rutgers [dot] edu**Doron Zeilberger**, Rutgers University, zeilberg {at} math [dot] rutgers [dot] edu

Title: Symmetrically Inequivalent Partitions of a Square Array

Speaker: **Jocelyn Quaintance**, Rutgers University and West Virginia University

Date: Thursday, October 21, 2010 5:00pm

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

Abstract:

The purpose of this talk is to introduce the concept of proper arrays and methodologies on how to exactly enumerate these objects. There are two main methods of enumeration, a cellular automata and a generating function expression. This talk will focus on combinatorial methods used to derived the generating function formula. If time permits, I will describe the open question which has been puzzling me for the past four years. No background in enumerative combinatorics is assumed and this talk will be accessible to student. So come and play with the cubes!