Related papers: An efficient algorithm for deciding vanishing of S…

We give an algorithm to compute the integer cohomology groups of any real partial flag manifold, by computing the incidence coefficients of the Schubert cells. For even flag manifolds we determine the integer cohomology groups, by proving…

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…

We study the set of algebraic objects known as vanishing polynomials (the set of polynomials that annihilate all elements of a ring) over general commutative rings with identity. These objects are of special interest due to their close…

We use representation theory and Bott's theorem to show vanishing of higher cotangent cohomology modules for the homogeneous coordinate ring of Grassmannians in the Pl\"ucker embedding. As a biproduct we answer a question of Wahl about the…

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

We propose to study the quantum Schubert calculus for Schubert varieties, and investigate the smooth Schubert divisors X of the complete flag variety Fl_n. We provide a Borel-type ring presentation of the quantum cohomology of X. We derive…

We propose a theory of combinatorially explicit Schubert polynomials which represent the Schubert classes in the Borel presentation of the cohomology ring of orthogonal flag varieties. We use these polynomials to describe the arithmetic…

Based on the multiplicative rule of Schubert classes obtained in [Du3], we present an algorithm computing the product of two arbitrary Schubert classes. As a result, the algorithm gives also a method to compute the integral cohomology ring…

We establish an equivariant quantum Giambelli formula for partial flag varieties. The answer is given in terms of a specialization of universal double Schubert polynomials. Along the way, we give new proofs of the presentation of the…

We provide a polynomial time algorithm for computing the universal Gr\"obner basis of any polynomial ideal having a finite set of common zeros in fixed number of variables. One ingredient of our algorithm is an effective construction of the…

Let X be the flag variety of the symplectic group. We propose a theory of combinatorially explicit Schubert polynomials which represent the Schubert classes in the Borel presentation of the cohomology ring of X. We use these polynomials to…

We give the formula for multiplying a Schubert class on an odd orthogonal or symplectic flag manifold by a special Schubert class pulled back from a Grassmannian of maximal isotropic subspaces. This is also the formula for multiplying a…

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. A novel aspect of this alternative to earlier results is that it directly…

The monotone secant conjecture posits a rich class of polynomial systems, all of whose solutions are real. These systems come from the Schubert calculus on flag manifolds, and the monotone secant conjecture is a compelling generalization of…

We show that the Hilbert space with basis indexed by infinite permutations and the cohomology ring of the infinite flag variety can be seen as representations of the Heisenberg algebra, which are isomorphic using the back-stable Schubert…

We give a criterion for a collection of polynomials to be a universal Gr\"{o}bner basis for an ideal in terms of the multidegree of the closure of the corresponding affine variety in $(\mathbb{P}^1)^N$. This criterion can be used to give…

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…

We give a signed puzzle rule to compute Schubert coefficients. The rule is based on a careful analysis of Knutson's recurrence arXiv:math/0306304. We use the rule to prove polynomiality of the sums of Schubert coefficients with bounded…

A fast and weakly stable method for computing the zeros of a particular class of hypergeometric polynomials is presented. The studied hypergeometric polynomials satisfy a higher order differential equation and generalize Laguerre…

We develop numerical homotopy algorithms for solving systems of polynomial equations arising from the classical Schubert calculus. These homotopies are optimal in that generically no paths diverge. For problems defined by hypersurface…