Promotion permutations for tableaux
From MaRDI portal
Publication:6615532
DOI10.5070/c64264251zbMATH Open1547.0531MaRDI QIDQ6615532
Jessica Striker, Stephan Pfannerer, Oliver Pechenik, Christian Gaetz, Joshua P. Swanson
Publication date: 8 October 2024
Published in: Combinatorial Theory (Search for Journal in Brave)
Combinatorial aspects of representation theory (05E10) Group actions on combinatorial structures (05E18)
Cites Work
- Unnamed Item
- Unnamed Item
- A simple bijection between standard \(3\times n\) tableaux and irreducible webs for \(\mathfrak{sl}_{3}\)
- Proofs and generalizations of a homomesy conjecture of Propp and Roby
- Rational tableaux and the tensor algebra of \(gl_ n\)
- Promotion and cyclic sieving via webs
- Orthogonal tableaux and an insertion algorithm for \(SO(2n+1)\)
- Cyclic sieving, promotion, and representation theory
- Promotion and evacuation
- Dual equivalence with applications, including a conjecture of Proctor
- An analogue of Jeu de taquin for Littelmann's crystal paths
- Web bases for \(\text{sl}(3)\) are not dual canonical
- Promotion des morphismes d'ensembles ordonnes
- Spiders for rank 2 Lie algebras
- Coboundary categories and local rules
- Promotion of Kreweras words
- The Berenstein-Kirillov group and cactus groups
- Promotion on oscillating and alternating tableaux and rotation of matchings and permutations
- 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
- An explicit bijection between semistandard tableaux and non-elliptic \(sl _{3}\) webs
- Cyclic sieving of increasing tableaux and small Schröder paths
- Crystals and coboundary categories
- Enumeration of plane partitions
- Crystalizing the q-analogue of universal enveloping algebras
- Crystal Bases
- Canonical Bases Arising from Quantized Enveloping Algebras
- The invariant theory of binary forms
- Canonical Bases Arising from Quantized Enveloping Algebras. II
- Schubert problems with respect to osculating flags of stable rational curves
- On the combinatorics of crystal graphs, II. The crystal commutor
- Relations between the ‘percolation’ and ‘colouring’ problem and other graph-theoretical problems associated with regular planar lattices: some exact results for the ‘percolation’ problem
- Promotion on generalized oscillating tableaux and web rotation
- Complementary algorithms for tableaux
- A concise proof of the Littlewood-Richardson rule
- Tableau evacuation and webs
- Promotion and growth diagrams for fans of Dyck paths and vacillating tableaux
- A cyclic sieving phenomenon for symplectic tableaux
This page was built for publication: Promotion permutations for tableaux