Balanced labellings and Schubert polynomials

36Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We study Balanced labellings of diagrams representing the inversions in a permutation. These are known to be natural encodings of reduced decompositions of permutations w ∈ Σn, and we show that they also give combinatorial descriptions of both the Stanley symmetric functions Fw, and the Schubert polynomial G-fraktur signw associated with w. Furthermore, they lead to an explicit basis for the Schubert modules introduced by Kraskiewicz and Pragacz. © 1997 Academic Press Limited.

Cite

CITATION STYLE

APA

Fomin, S., Greene, C., Reiner, V., & Shimozono, M. (1997). Balanced labellings and Schubert polynomials. European Journal of Combinatorics, 18(4), 373–389. https://doi.org/10.1006/eujc.1996.0109

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free