Balanced labellings and Schubert polynomials (Q1357263): Difference between revisions

By a diagram the authors mean a finite collection of cells in \({\mathbb Z}\times {\mathbb Z}\). They consider balanced labellings of diagrams. Special cases of these objects are the standard Young tableaux and the balanced tableaux introduced by \textit{P. Edelman} and \textit{C. Greene} [Adv. Math. 63, 42-99 (1987; Zbl 0616.05005)]. It turns out that for certain diagrams associated with permutations of the symmetric group \(\Sigma_n\), the set of balanced labellings has a remarkable rich structure. Balanced labellings of permutation diagrams yield the symmetric functions introduced by \textit{R. P. Stanley} [Eur. J. Comb. 5, 359-372 (1984; Zbl 0587.20002)] in the same way as the Schur functions can be constructed from column-strict tableaux. Balanced labelled diagrams can be also viewed as encodings of reduced decompositions of permutations. Imposing flag conditions, the authors obtain the Schubert polynomials of Lascoux and Schützenberger. Finally the authors construct an explicit basis for the Schubert module introduced in 1986 by W. Kraskiewicz and P. Pragacz (i.e. the representation of the upper triangular group with formal character equal to the corresponding Schubert polynomial).