Bijections between oscillating tableaux and (semi)standard tableaux via growth diagrams
From MaRDI portal
Publication:739392
DOI10.1016/j.jcta.2016.06.015zbMath1343.05164arXiv1412.5646OpenAlexW2140640925MaRDI QIDQ739392
Publication date: 18 August 2016
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1412.5646
semistandard tableauxRobinson-Schensted correspondencestandard Young tableauxRobinson-Schensted-Knuth correspondencegrowth diagramsoscillating tableaux
Related Items (8)
A generating tree approach to \(k\)-nonnesting partitions and permutations ⋮ Bijections for Weyl chamber walks ending on an axis, using arc diagrams and Schnyder woods ⋮ Pieri rules for classical groups and equinumeration between generalized oscillating tableaux and semistandard tableaux ⋮ Polynomiality of certain average weights for oscillating tableaux ⋮ A Sundaram type bijection for \(\mathrm{SO}(3)\): vacillating tableaux and pairs of standard Young tableaux and orthogonal Littlewood-Richardson tableaux ⋮ Tableau sequences, open diagrams, and Baxter families ⋮ A Sundaram type bijection for \(\mathrm{SO}(2k+1)\): vacillating tableaux and pairs consisting of a standard Young tableau and an orthogonal Littlewood-Richardson tableau ⋮ Bijection between increasing binary trees and rook placements on double staircases
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random walks in Weyl chambers and the decomposition of tensor powers
- Tableau sequences, open diagrams, and Baxter families
- Orthogonal tableaux and an insertion algorithm for \(SO(2n+1)\)
- Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
- Generalized Robinson-Schensted-Knuth correspondence
- The Cauchy identity for \(Sp(2n)\)
- A Schensted-type correspondence for the symplectic group
- A linear operator for symmetric functions and tableaux in a strip with given trace
- An extension of Schensted's theorem
- Identities for classical group characters of nearly rectangular shape
- Schensted algorithms for dual graded graphs
- Spin-preserving Knuth correspondences for ribbon tableaux
- The Robinson-Schensted correspondence for skew oscillating tableaux
- The connection between the Robinson-Schensted correspondence for skew oscillating tableaux and graded graphs
- Schur operators and Knuth correspondences
- The Robinson-Schensted and Schützenberger algorithms, an elementary approach
- Permutations, matrices, and generalized Young tableaux
- A Baxter class of a different kind, and other bijective results using tableau sequences ending with a row shape
- Longest Increasing and Decreasing Subsequences
- A Generalized Berele-Schensted Algorithm and Conjectured Young Tableaux for Intermediate Symplectic Groups
- Crossings and nestings of matchings and partitions
- Random Walk in a Weyl Chamber
- La correspondance de Robinson
- Quelques remarques sur une Construction de Schensted.
- An analogue to Robinson-Schensted correspondence for oscillating tableaux
- Finite posets and Ferrers shapes
This page was built for publication: Bijections between oscillating tableaux and (semi)standard tableaux via growth diagrams
