Fall 2026

Sep 14, 2026 : Zach Martin

Title: A Characterization of Size 2 Orbits of Plane Partitions Under Rowmotion

Abstract: We study the action of rowmotion on plane partitions in the [a]×[b]×[c] poset, focusing on orbits of size 2. We identify orbits of size 2 with a coloring approach that helps identify the hidden structures of orbits of size 2. These colorings are shown to have restrictive properties that force conditions on the dimensions of our poset a, b, and c. We then show that these conditions entirely describe all posets [a] × [b] × [c] that will contain orbits of size 2. Finally, we show that these colorings are in bijection with lozenge tilings of zonogons with dimensions corresponding a, b, and c allowing us to count all orbits of size 2 in a given poset by using Macmahon’s box formula and generate all orbits of size 2 by following our bijection. 

Sep 28, 2026 : Corey Nelson

Title:  Permutation Sorting and the Basis of Foot-sortable Sock Orderings

Abstract: In this talk, I'll discuss the toy problem of permutation sorting with a stack data structure, as well as how this problem generalizes to sorting permutations of multisets. The more basic problem was introduced in the 1970s in Donald Knuth's "Art of Computer Programming," while the latter emerged only a few years ago from Defant and Kravitz. The latter portion of the talk will be based on prior work with Theodore Molla (University of South Florida) and our paper "The Basis of Foot-sortable Sock Orderings"