On the Multiplication of Schubert Polynomials
β Scribed by Rudolf Winkel
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 276 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0196-8858
No coin nor oath required. For personal study only.
β¦ Synopsis
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 symmetric polynomial, and describe some observations in the direction of a general rule.
π SIMILAR VOLUMES
Schubert polynomials were introduced and extensively developed by Lascoux and SchΓΌtzenberger, after an earlier less combinatorial version had been considered by Bernstein, Gelfand and Gelfand and Demazure. We give a new development of the theory of Schubert polynomials based on formal computations i
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
This paper deals with Hermite Pade polynomials in the case where the multiple orthogonality condition is related to semiclassical functionals. The polynomials, introduced in such a way, are a generalization of classical orthogonal polynomials (Jacobi, Laguerre, Hermite, and Bessel polynomials). They
and Terwilliger recently introduced the notion of a tridiagonal pair. We apply their results to distance-regular graphs and obtain the following theorem. THEOREM. Let denote a distance-regular graph with diameter D β₯ 3. Suppose is Q-polynomial with respect to the ordering E 0 , E 1 , . . . , E D of