Discrete Math Seminar: Steph van Willigenburg

Walks in the plane taking unit-length steps north and east from $(0,0)$ to $(n,n)$ never dropping below $x=y$, and parking cars subject to preferences, are two intriguing ingredients in a formula conjectured in 2005, now famously known as the shuffle conjecture.

 

Here we describe the combinatorial tools needed to state the conjecture. We also give key parts and people in its history, including its eventual algebraic solution by Carlsson and Mellit, which was published in the Journal of the American Mathematical Society in 2018. Finally, we conclude with some remaining open problems.

 

(This is a practice run for my JMM Invited Address, so is intended for a general audience and feedback is welcome.)