A symmetry property for q-weighted Robinson-Schensted and other branching insertion algorithms

DOI10.1007/S10801-014-0505-XMaRDI QIDQ472629zbMATH OpenOpenAlexWikidataFDO

Authors Yuchen Pei

Publication date 19 November 2014

Published in Journal of Algebraic Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1306.2208

zbMATH Keywords

\(q\)-analoguegrowth diagrampermutationRobinson-Schensted algorithm

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) (q)-calculus and related topics (05A30) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10)

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).

Recommendations

• A \(q\)-weighted version of the Robinson-Schensted algorithm
• A \(q\)-Robinson-Schensted-Knuth algorithm and a \(q\)-polymer
• Properties of the nonsymmetric Robinson-Schensted-Knuth algorithm
• Shifted tableaux, Schur q-functions, and a conjecture of R. Stanley
• \(q\text{RS}t\): a probabilistic Robinson-Schensted correspondence for Macdonald polynomials

Cites work

• A \(q\)-weighted version of the Robinson-Schensted algorithm
• A path-transformation for random walks and the Robinson-Schensted correspondence
• An extension of Schensted's theorem
• Conditioned random walks and the RSK correspondence
• Directed polymers and the quantum Toda lattice
• Duality of graded graphs
• Enumerative combinatorics. Volume 2.
• Exact results for one-dimensional totally asymmetric diffusion models
• Four correspondences between graphs and generalized Young tableaux
• scientific article; zbMATH DE number 1001729 (Why is no real title available?)
• scientific article; zbMATH DE number 4079428 (Why is no real title available?)
• scientific article; zbMATH DE number 3604907 (Why is no real title available?)
• scientific article; zbMATH DE number 1181673 (Why is no real title available?)
• scientific article; zbMATH DE number 1445471 (Why is no real title available?)
• Longest Increasing and Decreasing Subsequences
• Nearest neighbor Markov dynamics on Macdonald processes
• On a classical limit of \(q\)-deformed Whittaker functions
• On the Representations of the Symmetric Group
• Permutations, matrices, and generalized Young tableaux
• Relativistic Toda systems
• Schensted algorithms for dual graded graphs
• Shape fluctuations and random matrices

Cited in

(6)

• A \(q\)-Robinson-Schensted-Knuth algorithm and a \(q\)-polymer
• qRSt: a probabilistic Robinson-Schensted correspondence for Macdonald polynomials
• A \(q\)-weighted version of the Robinson-Schensted algorithm
• Yang-Baxter field for spin Hall-Littlewood symmetric functions
• \(qt\mathrm{RSK}^\ast\): a probabilistic dual RSK correspondencefor Macdonald polynomials
• Law of large numbers for infinite random matrices over a finite field

This page was built for publication: A symmetry property for \(q\)-weighted Robinson-Schensted and other branching insertion algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472629)