University of Minnesota Combinatorics Seminar
Friday, September 28, 2012
3:35pm in 570 Vincent Hall



Enumeration of graded (3 + 1)-free posets

Joel Brewster Lewis

University of Minnesota


Abstract

The notion of (3 + 1)-avoidance has shown up in many places in enumerative combinatorics. The natural goal of enumerating of all (3 + 1)-avoiding posets remains open. In this talk, we enumerate graded (3 + 1)-avoiding posets via structural theorems and generating function magic.