Anti-ribbon shaped Young diagram decomposition
Hideki Murahara, Maki Nakasuji, Wataru Takeda
Abstract
We introduce a sliding procedure on diagrams which splits the standard Young tableaux of a corner-crossed diagram, in particular of a skew shape, along a finite binary tree whose leaves are anti-ribbon diagrams. Combined with standardization, this yields a decomposition of semi-standard Young tableaux into tableaux of anti-ribbon shape, indexed by standard tableaux and governed by their descent sets. As applications, we obtain expansions of Schur functions and Schur multiple zeta functions in terms of their anti-ribbon type analogues; at the level of Schur functions, this is a tableau-level form of Gessel's fundamental quasisymmetric expansion.
Create a lesson
Related papers
Clique partitions and distinct color sets in list colorings
Jun Yue
The parity of the number of missing integers in partitions
Julia Q. D. Du, Gurinder Singh
Three-critical hypergraphs of maximum local edge connectivity two
Jun Yue
A Murnaghan--Nakayama rule for dual stable Grothendieck functions
Dang Tuan Hiep, Do Le Hai Thuy
On the classification of 2-distance-primitive graphs of small valency
Xing Zhang, Xue Wang, Jun-Jie Huang
Combinatorics of noncommutative harmonic oscillator determinant
Masato Wakayama, Wadim Zudilin