Weak dual equivalence for polynomials
Combinatorics
2017-02-15 v1
Abstract
We use dual equivalence to give a short, combinatorial proof that Stanley symmetric functions are Schur positive. We introduce weak dual equivalence, and use it to give a short, combinatorial proof that Schubert polynomials are key positive. To demonstrate further the utility of this new tool, we use weak dual equivalence to prove a nonnegative Littlewood--Richardson rule for the key expansion of the product of a key polynomial and a Schur polynomial, and to introduce skew key polynomials that, when skewed by a partition, expand nonnegatively in the key basis.
Cite
@article{arxiv.1702.04051,
title = {Weak dual equivalence for polynomials},
author = {Sami Assaf},
journal= {arXiv preprint arXiv:1702.04051},
year = {2017}
}
Comments
26 pages, 23 figures