Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

$q{\rm RS}t$: A probabilistic Robinson--Schensted correspondence for Macdonald polynomials (2009.03526v2)

Published 8 Sep 2020 in math.CO and math.PR

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.

Summary

We haven't generated a summary for this paper yet.