作者: Nantel Bergeron , Sara Billey
DOI: 10.1080/10586458.1993.10504567
关键词:
摘要: Using a formula of Billey, Jockusch and Stanley, Fomin Kirillov have introduced new set diagrams that encode the Schubert polynomials. We call these objects rc-graphs. define prove two variants an algorithm for constructing all rc-graphs given permutation. This construction makes many identities known polynomials more apparent, yields ones. In particular, we give proof Monk's rule using insertion on conjecture analogs Pieri's multiplying also extend to generate double