Bijective Proofs of Character Evaluations Using the Trace Forest of Jeu de Taquin - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Seminaire Lotharingien de Combinatoire Année : 2015

Bijective Proofs of Character Evaluations Using the Trace Forest of Jeu de Taquin

Résumé

Irreducible characters of the symmetric group are of special interest in combina-torics. They can be expressed either combinatorially using ribbon tableaux, or algebraically using 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 the help of 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 provides combinatorial proofs of more complicated character formulae in terms of contents.
Fichier principal
Vignette du fichier
s72fang.pdf (222.32 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01259404 , version 1 (20-01-2016)

Identifiants

  • HAL Id : hal-01259404 , version 1

Citer

Wenjie Fang. Bijective Proofs of Character Evaluations Using the Trace Forest of Jeu de Taquin. Seminaire Lotharingien de Combinatoire, 2015, 72. ⟨hal-01259404⟩
42 Consultations
49 Téléchargements

Partager

Gmail Facebook X LinkedIn More