RC-graphs and a generalized Littlewood-Richardson rule (Q2746853)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: RC-graphs and a generalized Littlewood-Richardson rule |
scientific article; zbMATH DE number 1656645
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | RC-graphs and a generalized Littlewood-Richardson rule |
scientific article; zbMATH DE number 1656645 |
Statements
2 October 2002
0 references
Schubert polynomials
0 references
Schur functions
0 references
Littlewood-Richardson rule
0 references
Monk's rule
0 references
Pieri's rule
0 references
RC-graphs
0 references
RC-graphs and a generalized Littlewood-Richardson rule (English)
0 references
How to multiply two Schubert polynomials is a notorious open problem in Schubert calculus. The author addresses the special case where a Schubert polynomial is multiplied by a Schur polynomial. His result is a (not very efficient but still beautiful) description of the expansion coefficients in this product as the number of pairs of an RC-graph as introduced by \textit{S. Fomin} and \textit{A. N. Kirillov} [Discrete Math. 153, 123-143 (1996; Zbl 0852.05078)] and a Young tableau, which have to be related in a certain way. The proof of this result is entirely based on the insertion algorithm for RC-graphs due to \textit{N. Bergeron} and \textit{S. Billey} [Exp. Math. 2, 257-269 (1993; Zbl 0803.05054)].
0 references
0.8906116485595703
0 references
0.8898506760597229
0 references
0.8123736381530762
0 references
0.8093942403793335
0 references
0.808388888835907
0 references
