✦ LIBER ✦

Schubert polynomials of types A--D

✍ Scribed by Rudolf Winkel

Book ID: 105924189
Publisher: Springer
Year: 1999
Tongue: English
Weight: 159 KB
Volume: 100
Category: Article
ISSN: 0025-2611
DOI: 10.1007/s002290050195

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multiplication of a Schubert polynomial

Multiplication of a Schubert polynomial by a Schur polynomial

✍ Axel Kohnert 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 286 KB

A combinatorial construction of the Schu

A combinatorial construction of the Schubert polynomials

✍ Nantel Bergeron 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 729 KB

On the Multiplication of Schubert Polyno

On the Multiplication of Schubert Polynomials

✍ Rudolf Winkel 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 276 KB

Finding a combinatorial rule for the multiplication of Schubert polynomials is a long standing problem. In this paper we give a combinatorial proof of the extended Pieri rule as conjectured by N. Bergeron and S. Billey, which says how to multiply a Schubert polynomial by a complete or elementary sym

Schur and Schubert polynomials as Thom p

Schur and Schubert polynomials as Thom polynomials—cohomology of moduli spaces

✍ László M. Fehér; Richárd Rimányi 📂 Article 📅 2003 🏛 SP Versita 🌐 English ⚖ 364 KB

A Unified Approach to Combinatorial Form

A Unified Approach to Combinatorial Formulas for Schubert Polynomials

✍ Cristian Lenart 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 303 KB

Diagram Rules for the Generation of Schu

Diagram Rules for the Generation of Schubert Polynomials

✍ Rudolf Winkel 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 332 KB

We prove an elegant combinatorial rule for the generation of Schubert polynomials based on box diagrams, which was conjectured by A. Kohnert. The main tools for the proof are (1) a recursive structure of Schubert polynomials and (2) a partial order on the set of box diagrams. As a byproduct we obtai