$q\mathrm{RS}t$: A probabilistic Robinson--Schensted correspondence for Macdonald polynomials

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 $q$ and $t$, 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 $x_1\cdots x_n{y}_1\cdots y_n$ on either side, which are related to permutations and standard Young tableaux). By specializing $q$ and $t$ in various ways, one recovers the row and column insertion versions of the Robinson--Schensted correspondence, several $q$- and $t$-deformations of row and column insertion which have been introduced in recent years in connection with $q$-Whittaker and Hall--Littlewood processes, and the Plancherel measure on partitions. Our construction is based on Fomin's growth diagrams and the recently introduced notion of a probabilistic bijection between weighted sets.

47 pages. v2: minor improvements, several references and remarks added, Remark 5.4 corrected

References in corpus (2)

• A q-weighted version of the Robinson-Schensted algorithm
• Mapping TASEP back in time

Cited by in corpus (1)

• $q\mathrm{RS}t$: A probabilistic Robinson--Schensted correspondence for Macdonald polynomials (extended abstract)