Dual Equivalence Graphs Revisited

• Main Author: Roberts, Austin
• Other Authors: Department of Mathematics Seattle, University of Washington Seattle, Alain Goupil and Gilles Schaeffer
• Format: Conference Object
• Language: English
• Published: HAL CCSD 2013
• Subjects: Dual equivalence graph; LLT polynomial; Macdonald polynomial; Schur expansion; quasisymmetric function; [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]; Haglund; sami
• Online Access: https://inria.hal.science/hal-01229693; https://inria.hal.science/hal-01229693/document; https://inria.hal.science/hal-01229693/file/dmAS0178.pdf; https://doi.org/10.46298/dmtcs.2354

International audience In 2007 Sami Assaf introduced dual equivalence graphs as a method for demonstrating that a quasisymmetric function is Schur positive. The method involves the creation of a graph whose vertices are weighted by Ira Gessel's fundamental quasisymmetric functions so that the sum of the weights of a connected component is a single Schur function. In this paper, we improve on Assaf's axiomatization of such graphs, giving locally testable criteria that are more easily verified by computers. We then demonstrate the utility of this result by giving explicit Schur expansions for a family of Lascoux-Leclerc-Thibon polynomials. This family properly contains the previously known case of polynomials indexed by two skew shapes, as was described in a 1995 paper by Christophe Carré and Bernard Leclerc. As an immediate corollary, we gain an explicit Schur expansion for a family of modified Macdonald polynomials in terms of Yamanouchi words. This family includes all polynomials indexed by shapes with less than four cells in the first row and strictly less than three cells in the second row, a slight improvement over the known two column case described in 2005 by James Haglund, Mark Haiman, and Nick Loehr.