Seminar:
Spring 2014, Thursdays, Blocker 113, 4:00-4:50 PM
Date: February 28
Mitchell Phillipson
Abstract
Matchings, partitions and permutations can all be realized as certain graph structures. In this talk I'll show how this is possible, and define and enumerate crossings and nestings. Finally these results will be generalized to polyominoes and recent results on these structures.