On formulas and some combinatorial properties of Schubert Polynomials
classification
🧮 math.RA
keywords
polynomialsschubertcombinatorialformulasgivepropertiessomealgorithms
read the original abstract
By applying a Gr\"{o}bner-Shirshov basis of the symmetric group $S_{n}$, we give two formulas for Schubert polynomials, either of which involves only nonnegative monomials. We also prove some combinatorial properties of Schubert polynomials. As applications, we give two algorithms to calculate the structure constants for Schubert polynomials, one of which depends on Monk's formula.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.