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

From MaRDI portal
Publication:896780

zbMATH Open1326.05166arXiv1403.5697MaRDI QIDQ896780FDOQ896780

W. Fang

Publication date: 14 December 2015

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

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.


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

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



Recommendations





Cited In (1)





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)