Sponsored by the Rutgers University Department of Mathematics and the
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)
Title: Simultaneous Core Partitions
Speaker: Anthony Zaleski, Rutgers University
Date: Thursday, October 13, 2016 5:00pm
Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ
The hook of a box in the Young diagram of a partition consists of the box itself and those directly below it and to its right. An s-core partition is one with no hooks of size s; an (s,t)-core partition avoids hooks of size s and t. We discuss computer methods used to analyze such partitions and give automated (and rigorous) proof of some asymptotic results.