Sponsored by the Rutgers University Department of Mathematics and the
Center for Discrete Mathematics and Theoretical Computer Science (DIMACS)
Title: Experimental Methods in Pattern Avoidance and Bijective Proofs (thesis defense)
Speaker: Nathaniel Shar, Rutgers University
Date: Thursday, March 31, 2016 5:00pm
Location: Hill Center, Room 705, Rutgers University, Busch Campus, Piscataway, NJ
We'll look at ways to set up large, but finite, systems of recurrence relations, called "enumeration schemes," to count classes of permutations containing repeating structures. We'll see how this leads to rigorous proofs of formulas for the sizes of those classes with "guess and check" methods. If time permits, (which it probably will not), I will also discuss other experimental-mathematical topics from my thesis.