A symmetry property for q-weighted Robinson-Schensted algorithms and other branching insertion algorithms
Combinatorics
2013-06-12 v2 Mathematical Physics
math.MP
Probability
Representation Theory
Abstract
In O'Connell-Pei(2013) a q-weighted version of the Robinson-Schensted algorithm was introduced. In this paper we show that this algorithm has a symmetry property analogous to the well known symmetry property of the normal Robinson-Schensted algorithm. The proof uses a generalisation of the growth diagram approach introduced by Fomin(1979,1986,1994,1995). This approach, which uses "growth graphs", can also be applied to a wider class of insertion algorithms which have a branching structure, including some of the other q-weighted versions of the Robinson-Schensted algorithm which have recently been introduced by Borodin-Petrov(2013).
Keywords
Cite
@article{arxiv.1306.2208,
title = {A symmetry property for q-weighted Robinson-Schensted algorithms and other branching insertion algorithms},
author = {Yuchen Pei},
journal= {arXiv preprint arXiv:1306.2208},
year = {2013}
}
Comments
28 pages, many pictures