Recursive and combinatorial properties of Schubert polynomials
From MaRDI portal
Publication:1380717
zbMATH Open0886.05111MaRDI QIDQ1380717FDOQ1380717
Authors: Rudolf Winkel
Publication date: 12 March 1998
Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/119305
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cited In (14)
- Combinatorial relations on skew Schur and skew stable Grothendieck polynomials
- A unified approach to combinatorial formulas for Schubert polynomials
- On the expansion of Schur and Schubert polynomials into standard elementary monomials
- The Schubert calculus of decomposable permutations
- Diagram rules for the generation of Schubert polynomials
- Mitosis recursion for coefficients of Schubert polynomials
- Some combinatorial properties of Schubert polynomials
- Architectonics of Alain Lascoux's preferred formulas
- Using Schubert basis to compute with multivariate polynomials
- A recursion formula for \(k\)-Schur functions
- A combinatorial proof of a recursion for the \(q\)-Kostka polynomials
- Title not available (Why is that?)
- A weak version of Kirillov's conjecture on Hecke-Grothendieck polynomials
- Schubert functions and the number of reduced words of permutations
Uses Software
This page was built for publication: Recursive and combinatorial properties of Schubert polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380717)