Emily Barnard : Pop-stack sorting and pattern-avoiding permutations

Posted by Laura Schaposnik , part of the Departmental Colloquium.

At

Sept. 6, 2024, 3 p.m.

In

636 SEO

Abstract

The pop-stack sorting method takes an ordered list or permutation and reverses each descending run without changing their relative positions. In this talk we will review recent combinatorial results on the pop-stack sorting method, and we will extend the pop-stack sorting method to certain pattern avoiding permutations, called c-sortable. This talk will be accessible to all.