相关论文: Numerical Schubert calculus
In this paper, we develop in detail a fully geometrical method for deriving perturbation equations about a spatially homogeneous background. This method relies on the 3+1 splitting of the background space-time and does not use any…
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 consider optimization problems with polynomial inequality constraints in non-commuting variables. These non-commuting variables are viewed as bounded operators on a Hilbert space whose dimension is not fixed and the associated polynomial…
Homotopy methods are attractive due to their capability of solving difficult optimisation and optimal control problems. The underlying idea is to construct a homotopy, which may be considered as a continuous (zero) curve between the…
A natural Hasse-Schmidt derivation on the exterior algebra of a free module realizes the (small quantum) cohomology ring of the grassmannian $G_k(\CC^n)$ as a ring of operators on the exterior algebra of a free module of rank $n$. Classical…
In light of recently proposed quantum algorithms that incorporate symmetries in the hope of quantum advantage, we show that with symmetries that are restrictive enough, classical algorithms can efficiently emulate their quantum counterparts…
Physically meaningful periodic solutions to certain integrable partial differential equations are given in terms of multi-dimensional theta functions associated to real Riemann surfaces. Typical analytical problems in the numerical…
We survey the main numerical techniques for finite-dimensional nonlinear optimal control. The chapter is written as a guide to practitioners who wish to get rapidly acquainted with the main numerical methods used to efficiently solve an…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
We show that the Schubert calculus of enumerative geometry is real, for special Schubert conditions. That is, for any such enumerative problem, there exist real conditions for which all the a priori complex solutions are real.
In this paper we propose a method that uses Lagrange multipliers and numerical algebraic geometry to find all critical points, and therefore globally solve, polynomial optimization problems. We design a polyhedral homotopy algorithm that…
We connect generalized permutahedra with Schubert calculus. Thereby, we give sufficient vanishing criteria for Schubert intersection numbers of the flag variety. Our argument utilizes recent developments in the study of Schubitopes, which…
The grassmannian of hermitian lagrangian spaces in $\mathbb{C}^n\oplus \mathbb{C}^n$ is a natural compactification of the space of hermitian $n\times n$ matrices. We describe a Schubert-like, Whitney regular stratification on this space…
We present a homotopic approach to solving challenging, optimization-based motion planning problems. The approach uses Homotopy Optimization, which, unlike standard continuation methods for solving homotopy problems, solves a sequence of…
Schubert polynomials form a basis of all polynomials and appear in the study of cohomology rings of flag manifolds. The vanishing problem for Schubert polynomials asks if a coefficient of a Schubert polynomial is zero. We give a tableau…
We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…
We describe recent work on positive descriptions of the structure constants of the cohomology of homogeneous spaces such as the Grassmannian, by degenerations and related methods. We give various extensions of these rules, some new and…
Numerical homotopy continuation methods for three classes of polynomial systems are presented. For a generic instance of the class, every path leads to a solution and the homotopy is optimal. The counting of the roots mirrors the resolution…
A problem that is frequently encountered in a variety of mathematical contexts, is to find the common invariant subspaces of a single, or set of matrices. A new method is proposed that gives a definitive answer to this problem. The key idea…
The aim of this article is to link Schubert varieties in the flag manifold with hyperplane arrangements. For a permutation, we construct a certain graphical hyperplane arrangement. We show that the generating function for regions of this…