Signed enumeration of ribbon tableaux: an approach through growth diagrams

DOI10.1007/S10801-011-0324-2zbMATH Open1245.05133arXiv0911.3381OpenAlexW2051318795WikidataQ60691989 ScholiaQ60691989MaRDI QIDQ438737FDOQ438737

Authors: Dominique Gouyou-Beauchamps, Philippe Nadeau 

Publication date: 31 July 2012

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: We give an extension of the classical Schensted correspondence to the case of ribbon tableaux, where ribbons are allowed to be of different sizes. This is done by extending Fomin's growth diagram approach of the classical correspondence between permutations and pairs of standard tableaux of the same shape, in particular by allowing signs in the enumeration. As an application we give a combinatorial proof for the column sums of the character table of the symmetric group.

Full work available at URL: https://arxiv.org/abs/0911.3381

Recommendations

• A generating algorithm for ribbon tableaux and spin polynomials
• A doubly-refined enumeration of alternating sign matrices and descending plane partitions
• On symmetry and positivity for domino and ribbon tableaux
• Bijections between oscillating tableaux and (semi)standard tableaux via growth diagrams
• Edge sequences, ribbon tableaux, and an action of affine permutations
• Spin-preserving Knuth correspondences for ribbon tableaux
• A combinatorial formula for the signature of alternating diagrams
• The structure of the Tutte-Grothendieck ring of ribbon graphs
• \(k\)-ribbon Fibonacci tableaux
• Generalization of the Schensted algorithm for rim hook tableaux

zbMATH Keywords

RSK correspondencegrowth diagramsMurnaghan-Nakayama ruleGarsia-Milne involution principleribbon tableaux

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10)

Cites Work

• Title not available (Why is that?)
• Longest Increasing and Decreasing Subsequences
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Method for constructing bijections for classical partition identities
• Schur operators and Knuth correspondences
• Schensted algorithms for dual graded graphs
• Applied finite group actions.
• Title not available (Why is that?)
• Duality of graded graphs
• Differential Posets
• Title not available (Why is that?)
• Shifted tableaux, Schur q-functions, and a conjecture of R. Stanley
• A Schensted algorithm for rim hook tableaux
• Edge sequences, ribbon tableaux, and an action of affine permutations
• A bijection proving orthogonality of the characters of \(S_ n\)
• Title not available (Why is that?)
• A Rogers-Ramanujan bijection
• 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
• Robinson-Schensted algorithms for skew tableaux
• The Cauchy identity for \(Sp(2n)\)

Cited In (5)

• Growth diagrams, domino insertion and sign-imbalance
• Classic and Mirabolic Robinson–Schensted–Knuth Correspondence for Partial Flags
• Bijective proofs of character evaluations using the trace forest of jeu de taquin
• Growth diagrams and edge local rules
• Spin-preserving Knuth correspondences for ribbon tableaux

Uses Software

• OEIS

This page was built for publication: Signed enumeration of ribbon tableaux: an approach through growth diagrams

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q438737)