Results 1 to 10 of about 103 (93)

Upper bounds of Schubert polynomials [PDF]

open access: yesScience China Mathematics, 2021
14 pages, 4 ...
Fan, Neil Jiuyu, Guo, Peter Long
exaly   +4 more sources

The Prism tableau model for Schubert polynomials [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
The Schubert polynomials lift the Schur basis of symmetric polynomials into a basis for Z[x1; x2; : : :]. We suggest the prism tableau model for these polynomials.
Anna Weigandt, Alexander Yong
doaj   +4 more sources

RC-Graphs and Schubert Polynomials [PDF]

open access: yesExperimental Mathematics, 1993
Using a formula of Billey, Jockusch and Stanley, Fomin and Kirillov have introduced a new set of diagrams that encode the Schubert polynomials. We call these objects rc-graphs. We define and prove two variants of an algorithm for constructing the set of all rc-graphs for a given permutation.
Nantel Bergeron, Sara Billey
exaly   +3 more sources

Sparse multivariate polynomial interpolation on the basis of Schubert polynomials [PDF]

open access: yesComputational Complexity, 2016
Schubert polynomials were discovered by A. Lascoux and M. Schützenberger in the study of cohomology rings of flag manifolds in 1980's. These polynomials generalize Schur polynomials, and form a linear basis of multivariate polynomials. In 2003, Lenart and Sottile introduced skew Schubert polynomials, which generalize skew Schur polynomials, and expand ...
Priyanka Mukhopadhyay   +2 more
exaly   +3 more sources

Quantum double Schubert polynomials, quantum Schubert polynomials and Vafa–Intriligator formula

open access: yesDiscrete Mathematics, 2000
52 pages, LaTeX, revised version includes new title, new arrangement of material, some new remarks and formulas, additional references, in particular, on the preprint "Quantum Schubert polynomials" by S.Fomin, G.Gelfand and A ...
Toshiaki Maeno
exaly   +4 more sources

Tower tableaux and Schubert polynomials

open access: yesJournal of Combinatorial Theory - Series A, 2013
We prove that the well-known condition of being a balanced labeling can be characterized in terms of the sliding algorithm on tower diagrams. The characterization involves a generalization of authors' Rothification algorithm. Using the characterization, we obtain descriptions of Schubert polynomials and Stanley symmetric functions.
Olcay Coşkun
exaly   +3 more sources

The 6 Vertex Model and Schubert Polynomials [PDF]

open access: yesSymmetry, Integrability and Geometry: Methods and Applications, 2007
We enumerate staircases with fixed left and right columns. These objects correspond to ice-configurations, or alternating sign matrices, with fixed top and bottom parts.
Alain Lascoux
doaj   +6 more sources

Schubert Polynomials and the Nilcoxeter Algebra

open access: yesAdvances in Mathematics, 1994
Schubert polynomials \({\mathfrak S}_ \sigma(x_ 1,x_ 2,\dots)\) indexed by permutations have been introduced and investigated by \textit{I. N. Bernstein}, \textit{I. M. Gel'fand} and \textit{S. I. Gel'fand} [Russ. Math. Surveys 28, No. 3, 1-26 (1973; Zbl 0286.57025)], \textit{M. Demazure} [Ann. Sci. École Norm. Sup., IV. Sér.
Sergey Fomin
exaly   +3 more sources

Cauchy Identities for Universal Schubert Polynomials

open access: yesJournal of Mathematical Sciences, 2004
PlainTeX, 16 ...
Kirillov A N
exaly   +4 more sources

Schur and Schubert polynomials as Thom polynomials—cohomology of moduli spaces

open access: yesCentral European Journal of Mathematics, 2003
Richard Rimányi   +2 more
exaly   +2 more sources

Home - About - Disclaimer - Privacy