Signed enumeration of ribbon tableaux: an approach through growth diagrams
From MaRDI portal
Publication:438737
DOI10.1007/s10801-011-0324-2zbMath1245.05133arXiv0911.3381OpenAlexW2051318795WikidataQ60691989 ScholiaQ60691989MaRDI QIDQ438737
Philippe Nadeau, Dominique Gouyou-Beauchamps
Publication date: 31 July 2012
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.3381
Murnaghan-Nakayama ruleRSK correspondencegrowth diagramsGarsia-Milne involution principleribbon tableaux
Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10)
Uses Software
Cites Work
- A bijection proving orthogonality of the characters of \(S_ n\)
- Robinson-Schensted algorithms for skew tableaux
- The Cauchy identity for \(Sp(2n)\)
- A Schensted algorithm for rim hook tableaux
- Shifted tableaux, Schur q-functions, and a conjecture of R. Stanley
- A Rogers-Ramanujan bijection
- Edge sequences, ribbon tableaux, and an action of affine permutations
- Applied finite group actions.
- Duality of graded graphs
- Schensted algorithms for dual graded graphs
- A geometric version of the Robinson-Schensted correspondence for skew oscillating tableaux
- Color-to-spin ribbon Schensted algorithms
- 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
- Longest Increasing and Decreasing Subsequences
- Differential Posets
- Method for constructing bijections for classical partition identities
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Signed enumeration of ribbon tableaux: an approach through growth diagrams