Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Dual Equivalence Gra ...
Conference paper

Dual Equivalence Graphs Revisited

Austin Roberts (1)
(1) Department of Mathematics [Seattle]
Download article
Open on HAL
Imported on
November 21, 2016
Published on
December 31, 2012
Last modified on
March 31, 2025
Volume
DMTCS Proceedings vol. AS, 25th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2013)
Proceedings
DOI
10.46298/dmtcs.2354
License
https://about.hal.science/hal-authorisation-v1
National Science Foundation
1101017
Combinatorial and Algebraic Aspects of Varieties
Indicators
673
Views
547
Downloads

Dual Equivalence Graphs Revisited

Austin Roberts (1)
(1) Department of Mathematics [Seattle]
Abstract
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.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Dual equivalence graph
  • LLT polynomial
  • Macdonald polynomial
  • Schur expansion
  • quasisymmetric function
Preview
Loading PDF preview...