Papers
Topics
Authors
Recent
2000 character limit reached

Weak dual equivalence for polynomials

Published 14 Feb 2017 in math.CO | (1702.04051v1)

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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.