$q{\rm RS}t$: A probabilistic Robinson--Schensted correspondence for Macdonald polynomials
Florian Aigner, Gabriel Frieden

TL;DR
This paper introduces a probabilistic Robinson--Schensted correspondence parametrized by q and t, providing a new proof of a key identity for Macdonald polynomials and unifying various deformations and special cases.
Contribution
It develops a probabilistic generalization of the Robinson--Schensted correspondence that encompasses multiple known variants and offers a new proof of a fundamental Macdonald polynomial identity.
Findings
Provides a probabilistic bijection framework for Young tableaux
Recovers classical and deformed RS correspondences through specialization
Establishes connections with Macdonald polynomial identities
Abstract
We present a probabilistic generalization of the Robinson--Schensted correspondence in which a permutation maps to several different pairs of standard Young tableaux with nonzero probability. The probabilities depend on two parameters and , and the correspondence gives a new proof of the squarefree part of the Cauchy identity for Macdonald polynomials (i.e., the equality of the coefficients of on either side, which are related to permutations and standard Young tableaux). By specializing and in various ways, one recovers the row and column insertion versions of the Robinson--Schensted correspondence, several - and -deformations of row and column insertion which have been introduced in recent years in connection with -Whittaker and Hall--Littlewood processes, and the Plancherel measure on partitions. Our construction is based on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Algebraic structures and combinatorial models · Advanced Algebra and Geometry
