Schur-positive sets of permutations via products and grid classes

Sergi Elizalde, Yuval Roichman

Research output: Contribution to journalArticlepeer-review

19 Scopus citations

Abstract

Characterizing sets of permutations whose associated quasisymmetric function is symmetric and Schur-positive is a long-standing problem in algebraic combinatorics. In this paper, we present a general method to construct Schur-positive sets and multisets, based on geometric grid classes and the product operation. Our approach produces many new instances of Schur-positive sets and provides a broad framework that explains the existence of known such sets that until now were sporadic cases.

Original languageEnglish
Pages (from-to)363-405
Number of pages43
JournalJournal of Algebraic Combinatorics
Volume45
Issue number2
DOIs
StatePublished - 1 Mar 2017

Bibliographical note

Publisher Copyright:
© 2016, Springer Science+Business Media New York.

Funding

The authors thank Ron Adin, Michael Albert, Christos Athanasiadis, Mike Atkinson, Zach Hamaker and Bruce Sagan for useful discussions, comments and references. The authors also thank two anonymous referees for their thorough comments that have improved the presentation. The first author was partially supported by Grant #280575 from the Simons Foundation and by Grant H98230-14-1-0125 from the NSA. The second author was partially supported by Dartmouth’s Shapiro visitors fund.

FundersFunder number
Simons FoundationH98230-14-1-0125
National Security Agency

    Keywords

    • Descent classes
    • Geometric grid classes
    • Kronecker product
    • Pattern avoidance
    • Permutations
    • Schur-positivity

    Fingerprint

    Dive into the research topics of 'Schur-positive sets of permutations via products and grid classes'. Together they form a unique fingerprint.

    Cite this