English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

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

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