论文信息 - Balanced Labellings and Schubert Polynomials

Balanced Labellings and Schubert Polynomials

We studyBalanced labellingsof diagrams representing the inversions in a permutation. These are known to be natural encodings of reduced decompositions of permutationsw? ?n,and we show that they also give combinatorial descriptions of both the Stanley symmetric functionsFwand the Schubert polynomial Swassociated withw.Furthermore, they lead to an explicit basis for the Schubert modules introduced by Kraskiewicz and Pragacz.

[1] David A. Buchsbaum,et al. Schur Functors and Schur Complexes , 1982 .

[2] I. G. MacDonald,et al. Notes on Schubert polynomials , 1991 .

[3] Witold Kraskiewicz,et al. Reduced decompositions in Weyl groups , 1995, Eur. J. Comb..

[4] Alain Lascoux,et al. Schubert polynomials: a historic approach , 1995 .

[5] Richard Brauer,et al. Theory of group characters , 1979 .

[6] Richard P. Stanley,et al. Some Combinatorial Properties of Schubert Polynomials , 1993 .

[7] Matthias Dyer,et al. Hecke algebras and shellings of Bruhat intervals , 1993 .

[8] Sergey Fomin,et al. Schubert Polynomials and the Nilcoxeter Algebra , 1994 .

[9] Victor Reiner,et al. Key Polynomials and a Flagged Littlewood-Richardson Rule , 1995, J. Comb. Theory A.

[10] RICHARD P. STANLEY,et al. On the Number of Reduced Decompositions of Elements of Coxeter Groups , 1984, Eur. J. Comb..

[11] Nicolas Bourbaki,et al. Groupes et algèbres de Lie , 1971 .

[12] I. G. MacDonald,et al. Symmetric functions and Hall polynomials , 1979 .