A combinatorial bijection between standard Young tableaux and reduced words of Grassmannian permutations
From MaRDI portal
Publication:1380705
zbMATH Open0886.05115MaRDI QIDQ1380705FDOQ1380705
Authors: Rudolf Winkel 
Publication date: 12 March 1998
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119306
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- Stack words, standard Young tableaux, permutations with forbidden subsequences and planar maps
- scientific article; zbMATH DE number 192825
- Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted
- Permutations, matrices, and generalized Young tableaux
- Combinatorics of Young tableaux and configurations
- Reductions of Young tableau bijections
- Tableaux on \(k+1\)-cores, reduced words for affine permutations, and \(k\)-Schur expansions
- Alternating permutations with restrictions and standard Young tableaux
- Bijections for permutation tableaux
- Bijections for permutation tableaux
Cited In (9)
- Standard Rothe tableaux
- Reductions of Young tableau bijections
- The reduced expressions in a Coxeter system with a strictly complete Coxeter graph
- Reduced expressions in a Coxeter system with a complete Coxeter graph
- Catalan triangle, standard Young words and standard Young tableaux.
- Subalgebras of the Fomin-Kirillov algebra
- Tableaux on \(k+1\)-cores, reduced words for affine permutations, and \(k\)-Schur expansions
- A proof of Pieri’s formula using the generalized Schensted insertion algorithm for rc-graphs
- Combinatorics of diagrams of permutations
This page was built for publication: A combinatorial bijection between standard Young tableaux and reduced words of Grassmannian permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380705)
