Related papers: Certifiable Numerical Computations in Schubert Cal…
Extended formulations are an important tool in polyhedral combinatorics. Many combinatorial optimization problems require an exponential number of inequalities when modeled as a linear program in the natural space of variables. However, by…
We study Hilbert-Samuel multiplicity for points of Schubert varieties in the complete flag variety, by Groebner degenerations of the Kazhdan-Lusztig ideal. In the covexillary case, we give a positive combinatorial rule for multiplicity by…
The Schubert vanishing problem is a central decision problem in algebraic combinatorics and Schubert calculus, with applications to representation theory and enumerative algebraic geometry. The problem has been studied for over 50 years in…
We show that the principal specialization of the Schubert polynomial at $w$ is bounded below by $1+p_{132}(w)+p_{1432}(w)$ where $p_u(w)$ is the number of occurrences of the pattern $u$ in $w$, strengthening a previous result by A.…
There is a remarkable formula for the principal specialization of a type A Schubert polynomial as a weighted sum over reduced words. Taking appropriate limits transforms this to an identity for the backstable Schubert polynomials recently…
Let $\Phi$ be a root system. Postnikov introduced and studied the mixed $\Phi$-Eulerian numbers. These numbers indicate the mixed volumes of $\Phi$-hypersimplices. As specializations of these numbers, one can obtain the usual Eulerian…
We extend the classical Schubert calculus of enumerative geometry for the Grassmann variety of lines in projective space from the complex realm to the real. Specifically, given any collection of Schubert conditions on lines in projective…
In this paper we give a novel solution to a classical completion problem for square matrices. This problem was studied by many authors through time, and it is completely solved in [2, 3]. In this paper we relate this classical problem to a…
We study the computational complexity certification of inexact gradient augmented Lagrangian methods for solving convex optimization problems with complicated constraints. We solve the augmented Lagrangian dual problem that arises from the…
Discontinuity with respect to data perturbations is common in algebraic computation where solutions are often highly sensitive. Such problems can be modeled as solving systems of equations at given data parameters. By appending auxiliary…
Dual first-order methods are powerful techniques for large-scale convex optimization. Although an extensive research effort has been devoted to studying their convergence properties, explicit convergence rates for the primal iterates have…
Horospherical Schubert varieties are determined. It is shown that the stabilizer of an arbitrary point in a Schubert variety is a strongly solvable algebraic group. The connectedness of this stabilizer subgroup is discussed. Moreover, a new…
Semialgebraic splines are functions that are piecewise polynomial with respect to a cell decomposition into sets defined by polynomial inequalities. We study bivariate semialgebraic splines, formulating spaces of semialgebraic splines in…
We study the combinatorics of Gr\"obner degenerations of Grassmannians and the Schubert varieties inside them. We provide a family of binomial ideals whose combinatorics is governed by tableaux induced by matching fields in the sense of…
The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…
The goal of this paper is to solve a class of high-order polynomial benchmark optimization problems, including the Goldstein-Price problem and the Three Hump Camel Back problem. By using a generalized canonical duality theory, we are able…
Imanishi, Jinzenji and Kuwata provided a recipe for computing Euler number of Grassmann manifold $G(k,N)$ using physical model and its path-integral [S.Imanishi, M.Jinzenji and K.Kuwata, Journal of Geometry and Physics, Volume 180, October…
We introduce common generalization of (double) Schubert, Grothendieck, Demazure, dual and stable Grothendieck polynomials, and Di Francesco-Zinn-Justin polynomials. Our approach is based on the study of algebraic and combinatorial…
The coalgebraic $\mu$-calculus provides a generic semantic framework for fixpoint logics over systems whose branching type goes beyond the standard relational setup, e.g. probabilistic, weighted, or game-based. Previous work on the…
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…