1,696 research outputs found
Skew Schubert polynomials
We define skew Schubert polynomials to be normal form (polynomial)
representatives of certain classes in the cohomology of a flag manifold. We
show that this definition extends a recent construction of Schubert polynomials
due to Bergeron and Sottile in terms of certain increasing labeled chains in
Bruhat order of the symmetric group. These skew Schubert polynomials expand in
the basis of Schubert polynomials with nonnegative integer coefficients that
are precisely the structure constants of the cohomology of the complex flag
variety with respect to its basis of Schubert classes. We rederive the
construction of Bergeron and Sottile in a purely combinatorial way, relating it
to the construction of Schubert polynomials in terms of rc-graphs.Comment: 10 pages, 7 figure
Sparse multivariate polynomial interpolation in the basis of Schubert polynomials
Schubert polynomials were discovered by A. Lascoux and M. Sch\"utzenberger 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 in the Schubert basis with
the generalized Littlewood-Richardson coefficients.
In this paper we initiate the study of these two families of polynomials from
the perspective of computational complexity theory. We first observe that skew
Schubert polynomials, and therefore Schubert polynomials, are in \CountP
(when evaluating on non-negative integral inputs) and \VNP.
Our main result is a deterministic algorithm that computes the expansion of a
polynomial of degree in in the basis of Schubert
polynomials, assuming an oracle computing Schubert polynomials. This algorithm
runs in time polynomial in , , and the bit size of the expansion. This
generalizes, and derandomizes, the sparse interpolation algorithm of symmetric
polynomials in the Schur basis by Barvinok and Fomin (Advances in Applied
Mathematics, 18(3):271--285). In fact, our interpolation algorithm is general
enough to accommodate any linear basis satisfying certain natural properties.
Applications of the above results include a new algorithm that computes the
generalized Littlewood-Richardson coefficients.Comment: 20 pages; some typos correcte
Skew Divided Difference Operators and Schubert Polynomials
We study an action of the skew divided difference operators on the Schubert
polynomials and give an explicit formula for structural constants for the
Schubert polynomials in terms of certain weighted paths in the Bruhat order on
the symmetric group. We also prove that, under certain assumptions, the skew
divided difference operators transform the Schubert polynomials into
polynomials with positive integer coefficients.Comment: This is a contribution to the Vadim Kuznetsov Memorial Issue on
Integrable Systems and Related Topics, published in SIGMA (Symmetry,
Integrability and Geometry: Methods and Applications) at
http://www.emis.de/journals/SIGMA
Skew Divided Difference Operators and Schubert Polynomials
We study an action of the skew divided difference operators on the Schubert polynomials and give an explicit formula for structural constants for the Schubert polynomials in terms of certain weighted paths in the Bruhat order on the symmetric group. We also prove that, under certain assumptions, the skew divided difference operators transform the Schubert polynomials into polynomials with positive integer coefficients
- …