3:00–4:00 pm
Zoom Meeting To receive the zoom link, please sign up for our colloquium emails here.
Macdonald and Schubert Polynomials from Markov Chains
Abstract:
Two of the most famous families of polynomials in combinatorics are Macdonald polynomials and Schubert polynomials. Macdonald polynomials are a family of orthogonal symmetric polynomials which generalize Schur and Hall-Littlewood polynomials and are connected to the Hilbert scheme. Schubert polynomials also generalize Schur polynomials, and represent cohomology classes of Schubert varieties in the flag variety. Meanwhile, the asymmetric exclusion process (ASEP) is a model of particles hopping on a one-dimensional lattice, which was initially introduced by Macdonald-Gibbs-Pipkin to provide a model for translation in protein synthesis. In my talk I will explain how two different variants of the ASEP have stationary distributions which are closely connected to Macdonald polynomials and Schubert polynomials, respectively. This leads to new formulas and new conjectures.
This talk is based on joint work with Corteel-Mandelshtam, and joint work with Donghyun Kim.
