✦ LIBER ✦

A combinatorial construction of the Schubert polynomials

✍ Scribed by Nantel Bergeron

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 729 KB
Volume: 60
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(92)90002-c

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A combinatorial approach to the singular

A combinatorial approach to the singularities of Schubert varieties

✍ James S Wolper 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 464 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

A Combinatorial Interpretation of the Co

A Combinatorial Interpretation of the Conti–Contucci–Falcolini Polynomial

✍ Federico Incitti 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 173 KB

Conti et al. defined a two-variable polynomial associated with any rooted tree. In this paper we give an explicit combinatorial interpretation of the coefficients of this polynomial. In order to do this we introduce a special class of subtrees which seem to have never been considered before in the l

A combinatorial proof of a Chevyshev pol

A combinatorial proof of a Chevyshev polynomial identity

✍ Louis W. Shapiro 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 314 KB

In this note we consider a simple problem with Fibonacci numbers and then :llter it:, solution to produce a closed formula for

A Combinatorial Proof of a Recursion for

A Combinatorial Proof of a Recursion for the q-Kostka Polynomials

✍ Kendra Killpatrick 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 196 KB

The Kostka numbers K \* + play an important role in symmetric function theory, representation theory, combinatorics and invariant theory. The q-Kostka polynomials K \* + (q) are the q-analogues of the Kostka numbers and generalize and extend the mathematical meaning of the Kostka numbers. Lascoux an