Related papers: A lifted square formulation for certifiable Schube…

We try to understand and justify Schubert Calculus the way Schubert did it.

The main purpose of this paper is to show that the multiplication of a Schubert polynomial of finite type $A$ by a Schur function, which we refer to as Schubert vs. Schur problem, can be understood from the multiplication in the space of…

A multiplication on persistence diagrams is introduced by means of Schubert calculus. The key observation behind this multiplication comes from the fact that the representation space of persistence modules has the structure of the Schubert…

We obtain an explicit determinantal formula for the multiplicity of any point on a classical Schubert variety.

Let X be a symplectic or odd orthogonal Grassmannian parametrizing isotropic subspaces in a vector space equipped with a nondegenerate (skew) symmetric form. We prove a Giambelli formula which expresses an arbitrary Schubert class in…

Many aspects of Schubert calculus are easily modeled on a computer. This enables large-scale experimentation to investigate subtle and ill-understood phenomena in the Schubert calculus. A well-known web of conjectures and results in the…

We consider Hilbert algebras with a supplementary Fr\'echet topology and get various extensions of the algebraic structure by using duality techniques. In particular we obtain optimal multiplier-type involutive algebras, which in…

A quadratically constrained quadratic programming problem is considered in a Hilbert space setting, where neither the objective nor the constraint are convex functions. Necessary and sufficient conditions are provided to guarantee that the…

We apply the previous calculations of Chow-Witt rings of Grassmannians to develop an oriented analogue of the classical Schubert calculus. As a result, we get complete diagrammatic descriptions of the ring structure in Chow-Witt rings and…

Let $\left( W,\sigma \right) $ be a symplectic vector space and let $% T:W\rightarrow W$ be a linear map that satisfies a certain condition of non-degeneracy. We define the Schur multiplier $\omega _{\sigma ,T}$ on $W$. To this multiplier…

In paper I of this series we gave positive formulae for expanding the product $\mathfrak S^\pi \mathfrak S^\rho$ of two Schubert polynomials, in the case that both $\pi,\rho$ had shared descent set of size $\leq 3$. Here we introduce and…

We give new product formulas for the number of standard Young tableaux of certain skew shapes and for the principal evaluation of the certain Schubert polynomials. These are proved by utilizing symmetries for evaluations of factorial Schur…

The expansion of a Schubert polynomial into slide polynomials corresponds to a sum over sub-balls in the subword complex. There has been recent interest in other, coarser, expansions of Schubert polynomials. We extend the methods used in…

We prove lower bounds for the worst case error of quadrature formulas that use given sample points $\X_n = \{ x_1, \dots , x_n \}$. We are mainly interested in optimal point sets $\X_n$, but also prove lower bounds that hold with high…

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…

In this paper, we consider the quadratic programming problems under finitely many convex quadratic constraints in Hilbert spaces. By using the Legendre property of quadratic forms or the compactness of operators in the presentations of…

We propose a simple technique that, if combined with algorithms for computing functions of triangular matrices, can make them more efficient. Basically, such a technique consists in a specific scaling similarity transformation that reduces…

We consider the solution of the Sylvester equation $AX+XB=C$ in mixed precision. We derive a new iterative refinement scheme to solve perturbed quasi-triangular Sylvester equations; our rounding error analysis provides sufficient conditions…

We produce a family of reductions for Schubert intersection problems whose applicability is checked by calculating a linear combination of the dimensions involved. These reductions do not alter the Littlewood-Richardson coefficient, and…

Set-valued tableaux formulas play an important role in Schubert calculus. Using the box greedy reduced word for the construction of the Macdonald polynomials, we convert the alcove walk formula for Macdonald polynomials to a set-valued…