arXiv:1702.04051 [math.CO]AbstractReferencesReviewsResources
Weak dual equivalence for polynomials
Published 2017-02-14Version 1
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.
Comments: 26 pages, 23 figures
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:0902.2444 [math.CO] (Published 2009-02-14)
A combinatorial proof of a formula for Betti numbers of a stacked polytope
arXiv:1710.10373 [math.CO] (Published 2017-10-28)
Combinatorial proof of an identity of Andrews--Yee
arXiv:1711.06511 [math.CO] (Published 2017-11-17)
Towards a Combinatorial proof of Gessel's conjecture on two-sided Gamma positivity: A reduction to simple permutations