Location: HILL 705
Date & time: Thursday, 27 April 2017 at 5:00PM - 6:00PM
|Time: 5:00 PM|
|Location: Hill 705|
|Abstract: Restricted containers are a new data structure generalizing stacks, queues, and deques. I will describe how this viewpoint rapidly leads to functional equations for the classes of sortable permutations. These functional equations can sometimes be solved by the kernel method, but, much more easily, by the computer via guessing and checking.
I will also present several general results about the rationality, algebraicity, and the existence of Wilfian formulas for certain classes of permutations sortable by restricted containers and present several examples of relatively small permutation classes which, although we can generate thousands of terms of their enumerations via this viewpoint, appear to not have D-finite generating functions.
This is joint work with Michael Albert, Cheyne Homberger, Jay Pantone, and Nathaniel Shar.