Related papers: An efficient algorithm for deciding vanishing of S…
The quantum Bruhat graph, which is an extension of the graph formed by covering relations in the Bruhat order, is naturally related to the quantum cohomology ring of G/B. We enhance a result of Fulton and Woodward by showing that the…
In their study of infinite flag varieties, Lam, Lee, and Shimozono (2021) introduced bumpless pipe dreams in a new combinatorial formula for double Schubert polynomials. These polynomials are the TxT-equivariant cohomology classes of matrix…
Let $R=k[x_1,\dots,x_n]$ be a ring of polynomials over a field $k$ of characteristic $p>0$. There is an algorithm due to Lyubeznik for deciding the vanishing of local cohomology modules $H^i_I(R)$ where $I\subset R$ is an ideal. This…
An important breakthrough in understanding the geometry of Schubert varieties was the introduction of the notion of Frobenius split varieties and the result that the flag varieties G/P are Frobenius split. The aim of this article is to give…
Boris Shapiro and Michael Shapiro have a conjecture concerning the Schubert calculus and real enumerative geometry and which would give infinitely many families of zero-dimensional systems of real polynomials (including families of…
We study a family of polynomials whose values express degrees of Schubert varieties in the generalized complex flag manifold G/B. The polynomials are given by weighted sums over saturated chains in the Bruhat order. We derive several…
Extending results of Wyser, we determine formulas for the equivariant cohomology classes of closed orbits of certain families of spherical subgroups of $GL_n$ on the flag variety $GL_n/B$. Putting this together with a slight extension of…
We describe a new approach to the Schubert calculus on complete flag varieties using the volume polynomial associated with Gelfand-Zetlin polytopes. This approach allows us to compute the intersection products of Schubert cycles by…
When one expands a Schur function in terms of the irreducible characters of the symplectic (or orthogonal) group, the coefficient of the trivial character is 0 unless the indexing partition has an appropriate form. A number of q-analogues…
We consider a natural generalization of an abelian Hidden Subgroup Problem where the subgroups and their cosets correspond to graphs of linear functions over a finite field F with d elements. The hidden functions of the generalized problem…
These are extended notes of a talk given at Maurice Auslander Distinguished Lectures and International Conference (Woods Hole, MA) in April 2013. Their aim is to give an introduction into Schubert calculus on Grassmannians and flag…
Regular semisimple Hessenberg varieties are a family of subvarieties of the flag variety that arise in number theory, numerical analysis, representation theory, algebraic geometry, and combinatorics. We give a "Giambelli formula" expressing…
Motivated by a connection with the factorization of multivariate polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral…
We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…
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…
The Hidden Subgroup Problem is used in many quantum algorithms such as Simon's algorithm and Shor's factoring and discrete log algorithms. A polynomial time solution is known in case of abelian groups, and normal subgroups of arbitrary…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
Kohnert proposed the first monomial positive formula for Schubert polynomials as the generating polynomial for certain unit cell diagrams obtained from the Rothe diagram of a permutation. Billey, Jockusch and Stanley gave the first proven…
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…
Formulating a Schubert problem as the solutions to a system of equations in either Pl\"ucker space or in the local coordinates of a Schubert cell typically involves more equations than variables. We present a novel primal-dual formulation…