From 2a2c61de0e44adad26c0034dfda6594c34f0d834 Mon Sep 17 00:00:00 2001 From: Yuchen Pei Date: Fri, 6 Apr 2018 17:43:24 +0200 Subject: second commit --- .../2013-06-01-q-robinson-schensted-paper.html | 31 ++++++++++++++++++++++ 1 file changed, 31 insertions(+) create mode 100644 site/posts/2013-06-01-q-robinson-schensted-paper.html (limited to 'site/posts/2013-06-01-q-robinson-schensted-paper.html') diff --git a/site/posts/2013-06-01-q-robinson-schensted-paper.html b/site/posts/2013-06-01-q-robinson-schensted-paper.html new file mode 100644 index 0000000..b8f9e3d --- /dev/null +++ b/site/posts/2013-06-01-q-robinson-schensted-paper.html @@ -0,0 +1,31 @@ + + + + + A \(q\)-weighted Robinson-Schensted algorithm + + + + +
+ + +
+ +
+
+

A \(q\)-weighted Robinson-Schensted algorithm

+

Posted on 2013-06-01

+

In this paper with Neil we construct a \(q\)-version of the Robinson-Schensted algorithm with column insertion. Like the usual RS correspondence with column insertion, this algorithm could take words as input. Unlike the usual RS algorithm, the output is a set of weighted pairs of semistandard and standard Young tableaux \((P,Q)\) with the same shape. The weights are rational functions of indeterminant \(q\).

+

If \(q\in[0,1]\), the algorithm can be considered as a randomised RS algorithm, with 0 and 1 being two interesting cases. When \(q\to0\), it is reduced to the latter usual RS algorithm; while when \(q\to1\) with proper scaling it should scale to directed random polymer model in (O’Connell 2012). When the input word \(w\) is a random walk:

+

\begin{align*}\mathbb P(w=v)=\prod_{i=1}^na_{v_i},\qquad\sum_ja_j=1\end{align*}

+

the shape of output evolves as a Markov chain with kernel related to \(q\)-Whittaker functions, which are Macdonald functions when \(t=0\) with a factor.

+ +
+
+ + -- cgit v1.2.3