4 papers
Hook-valued tableau uncrowding and tableau switching
Jihyeug Jang, Jang Soo Kim, Jianping Pan +2
Refined canonical stable Grothendieck polynomials were introduced by Hwang, Jang, Kim, Song, and Song. There exist two combinatorial models for these polynomials: one using hook-va…
Uncrowding algorithm for hook-valued tableaux
Jianping Pan, Joseph Pappe, Wencin Poh +1
Whereas set-valued tableaux are the combinatorial objects associated to stable Grothendieck polynomials, hook-valued tableaux are associated to stable canonical Grothendieck polyno…
When is the chromatic quasisymmetric function symmetric?
Maria Gillespie, Joseph Pappe, Kyle Salois
We investigate the problem of when a chromatic quasisymmetric function (CQF) of a graph is in fact symmetric. We first prove the remarkable fact that if a product of…
A combinatorial proof of a symmetry for a refinement of the Narayana numbers
Miklós Bóna, Stoyan Dimitrov, Gilbert Labelle +4
We establish a tantalizing symmetry of certain numbers refining the Narayana numbers. In terms of Dyck paths, this symmetry is interpreted in the following way: if is t…