Related papers: Certifiable Numerical Computations in Schubert Cal…
We show that the dual character of the flagged Weyl module of any diagram is a positively weighted integer point transform of a generalized permutahedron. In particular, Schubert and key polynomials are positively weighted integer point…
We present sharp estimates for the extremal eigenvalues of the Schur complements arising in saddle point problems. These estimates are derived using the auxiliary space theory, in which a given iterative method is interpreted as an…
We survey the recent study of involution Schubert polynomials and a modest generalization that we call degenerate involution Schubert polynomials. We cite several conditions when (degenerate) involution Schubert polynomials have simple…
In this paper we reduce the problem of counting the number of connected components in the intersection of two opposite open Schubert cells in the variety of real complete flags to a purely combinatorial question of counting the number of…
We give a Molev-Sagan type formula for computing the product $\mathfrak{S}_u(x;y)\mathfrak{S}_v(x;z)$ of two double Schubert polynomials in different sets of coefficient variables where the descents of $u$ and $v$ satisfy certain conditions…
Our main theorems provide a single geometric setting in which polynomial representatives for Schubert classes in the integral cohomology ring of the flag manifold are determined uniquely, and have positive coefficients for geometric…
Let V be a 2n-dimensional complex symplectic space. Let G' be the Lagrangian Grassmannian of maximal isotropic subspaces of V embedded via the inclusion i into the Grassmannian G of all n-dimensional subspaces of V. We discuss the…
Numerical homotopy continuation of solutions to polynomial equations is the foundation for numerical algebraic geometry, whose development has been driven by applications of mathematics. We use numerical homotopy continuation to investigate…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
This paper addresses non-convex constrained optimization problems that are characterized by a scalar complicating constraint. We propose an iterative bisection method for the dual problem (DualBi Algorithm) that recovers a feasible primal…
In this chapter we derive computational complexity certifications of first order inexact dual methods for solving general smooth constrained convex problems which can arise in real-time applications, such as model predictive control. When…
This paper presents a solution to a problem from superanalysis about the existence of Hilbert-Banach superalgebras. Two main results are derived: 1) There exist Hilbert norms on some graded algebras (infinite-dimensional superalgebras…
We establish a Schubert calculus for Bott-Samelson resolutions in the algebraic cobordism ring of a complete flag variety G/B.
In this paper, we introduce a family of symmetric polynomials by specializing the factorial Schur polynomials. These polynomials represent the weighted Schubert classes of the cohomology of the weighted Grassmannian introduced by…
A regular nilpotent Hessenberg Schubert cell is the intersection of a regular nilpotent Hessenberg variety with a Schubert cell. In this paper, we describe a set of minimal generators of the defining ideal of a regular nilpotent Hessenberg…
We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…
The complexity of computing the solutions of a system of multivariate polynomial equations by means of Groebner bases computations is upper bounded by a function of the solving degree. In this paper, we discuss how to rigorously estimate…
We prove a Pieri formula for motivic Chern classes of Schubert cells in the equivariant K-theory of Grassmannians, which is described in terms of ribbon operators on partitions. Our approach is to transform the Schubert calculus over…
A general primal-dual splitting algorithm for solving systems of structured coupled monotone inclusions in Hilbert spaces is introduced and its asymptotic behavior is analyzed. Each inclusion in the primal system features compositions with…
We extend the classical primal-dual interior point method from the Euclidean setting to the Riemannian one. Our method, named the Riemannian interior point method, is for solving Riemannian constrained optimization problems. We establish…