A symmetry property for \(q\)-weighted Robinson-Schensted and other branching insertion algorithms
DOI10.1007/s10801-014-0505-xzbMath1303.05016arXiv1306.2208OpenAlexW2051421605WikidataQ59400271 ScholiaQ59400271MaRDI QIDQ472629
Publication date: 19 November 2014
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1306.2208
(q)-calculus and related topics (05A30) Permutations, words, matrices (05A05) Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)
Related Items (4)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nearest neighbor Markov dynamics on Macdonald processes
- A \(q\)-weighted version of the Robinson-Schensted algorithm
- Directed polymers and the quantum Toda lattice
- On a classical limit of \(q\)-deformed Whittaker functions
- An extension of Schensted's theorem
- Duality of graded graphs
- Schensted algorithms for dual graded graphs
- Four correspondences between graphs and generalized Young tableaux
- Shape fluctuations and random matrices
- Permutations, matrices, and generalized Young tableaux
- Relativistic Toda systems
- Longest Increasing and Decreasing Subsequences
- Exact results for one-dimensional totally asymmetric diffusion models
- A path-transformation for random walks and the Robinson-Schensted correspondence
- Conditioned random walks and the RSK correspondence
- On the Representations of the Symmetric Group
This page was built for publication: A symmetry property for \(q\)-weighted Robinson-Schensted and other branching insertion algorithms