Papers
Topics
Authors
Recent
Search
2000 character limit reached

Macdonald polynomials at t = 0 through (generalized) multiline queues

Published 7 Jul 2024 in math.CO | (2407.05362v1)

Abstract: Multiline queues are versatile objects arising from queueing theory in probability that have come to play a key role in understanding the remarkable connection between the asymmetric simple exclusion process (ASEP) on a circle and Macdonald polynomials. We define an insertion procedure we call collapsing on multiline queues which can be described by raising and lowering crystal operators. Using this procedure, one naturally recovers several classical results such as the Lascoux--Sch\"utzenberger charge formulas for $q$-Whittaker polynomials, Littlewood--Richardson coefficients and the dual Cauchy identity. We extend the results to generalized multiline queues by defining a statistic on these objects that allows us to derive a family of formulas, indexed by compositions, for the $q$-Whittaker polynomials.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.