Bijective proofs of character evaluations using the trace forest of jeu de taquin

MaRDI QIDQ896780zbMATHFDO

Authors W. Fang

Publication date 14 December 2015

Published in Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

irreducible characters of a symmetric group

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Combinatorial aspects of partitions of integers (05A17) Symmetric groups (20B30)

Abstract: Irreducible characters in the symmetric group are of special interest in combinatorics. They can be expressed either combinatorially with ribbon tableaux, or algebraically with contents. In this paper, these two expressions are related in a combinatorial way. We first introduce a fine structure in the famous jeu de taquin called "trace forest", with which we are able to count certain types of ribbon tableaux, leading to a simple bijective proof of a character evaluation formula in terms of contents that dates back to Frobenius (1901). Inspired by this proof, we give an inductive scheme that gives combinatorial proofs to more complicated formulae for characters in terms of contents.

Recommendations

• A bijection proving orthogonality of the characters of \(S_ n\)
• On trees and characters
• A symmetry theorem on a modified jeu de taquin
• Signed enumeration of ribbon tableaux: an approach through growth diagrams
• A symplectic jeu de taquin bijection between the tableaux of King and of De Concini

Cited in

(1)

• Enumerative combinatorics. Abstracts from the workshop held December 11--17, 2022

This page was built for publication: Bijective proofs of character evaluations using the trace forest of jeu de taquin

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