Signed enumeration of ribbon tableaux: an approach through growth diagrams

DOI10.1007/S10801-011-0324-2MaRDI QIDQ438737zbMATH OpenOpenAlexWikidataFDO

Authors Dominique Gouyou-Beauchamps, Philippe Nadeau

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

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)

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.

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

Cites work

• scientific article; zbMATH DE number 1601795 (Why is no real title available?)
• scientific article; zbMATH DE number 1001729 (Why is no real title available?)
• scientific article; zbMATH DE number 4160796 (Why is no real title available?)
• scientific article; zbMATH DE number 4079428 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 739282 (Why is no real title available?)
• scientific article; zbMATH DE number 1168037 (Why is no real title available?)
• scientific article; zbMATH DE number 862502 (Why is no real title available?)
• A Rogers-Ramanujan bijection
• A Schensted algorithm for rim hook tableaux
• A bijection proving orthogonality of the characters of \(S_ n\)
• A geometric version of the Robinson-Schensted correspondence for skew oscillating tableaux
• Applied finite group actions.
• Color-to-spin ribbon Schensted algorithms
• Differential Posets
• Duality of graded graphs
• Edge sequences, ribbon tableaux, and an action of affine permutations
• Longest Increasing and Decreasing Subsequences
• Method for constructing bijections for classical partition identities
• Robinson-Schensted algorithms for skew tableaux
• Schensted algorithms for dual graded graphs
• Schur operators and Knuth correspondences
• Shifted tableaux, Schur q-functions, and a conjecture of R. Stanley
• The Cauchy identity for Sp(2n)
• The Robinson-Schensted correspondence for skew oscillating tableaux
• The connection between the Robinson-Schensted correspondence for skew oscillating tableaux and graded graphs

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
• Spin-preserving Knuth correspondences for ribbon tableaux
• Growth diagrams and edge local rules

Describes a project that uses

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)