相关论文: Numerical Schubert calculus
We introduce an algorithm to describe Pieri's Rule for multiplication of Schubert polynomials. The algorithm uses tower diagrams introduced by the authors and another new algorithm that describes Monk's Rule. Our result is different from…
Enriched versions of type A Schubert polynomials are constructed with coefficients in a polynomial ring in variables $c_1, c_2, \ldots$. Specializing these variables to $0$ recovers the double Schubert polynomials of Lascoux and…
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…
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…
We describe, for the first time, a completely rigorous homotopy (path--following) algorithm (in the Turing machine model) to find approximate zeros of systems of polynomial equations. If the coordinates of the input systems and the initial…
We discuss umbral calculus as a method of systematically discretizing linear differential equations while preserving their point symmetries as well as generalized symmetries. The method is then applied to the Schr\"{o}dinger equation in…
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…
We develop algebraic tools for statistical inference from samples of rotation matrices. This rests on the theory of D-modules in algebraic analysis. Noncommutative Gr\"obner bases are used to design numerical algorithms for maximum…
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…
We present a new algorithmic framework which utilizes tropical geometry and homotopy continuation for solving systems of polynomial equations where some of the polynomials are generic elements in linear subspaces of the polynomial ring.…
The aim of this article is to explain a philosophy for applying higher dimensional Seifert-van Kampen Theorems, and how the use of groupoids and strict higher groupoids resolves some foundational anomalies in algebraic topology at the…
Many problems of systems control theory boil down to solving polynomial equations, polynomial inequalities or polyomial differential equations. Recent advances in convex optimization and real algebraic geometry can be combined to generate…
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…
Homotopy methods to solve polynomial systems are well suited for parallel computing because the solution paths defined by the homotopy can be tracked independently. Both the static and dynamic load balancing models are implemented in C with…
This paper presents a theoretical discussion as well as novel solution algorithms for problems of scattering on smooth two-dimensional domains under Zaremba boundary conditions for which Dirichlet and Neumann conditions are specified on…
In this paper, we explore the merits of various algorithms for polynomial optimization problems, focusing on alternatives to sum of squares programming. While we refer to advantages and disadvantages of Quantifier Elimination, Reformulation…
The parabolic Kazhdan-Lusztig polynomials for Grassmannians can be computed by counting Dyck partitions. We "lift" this combinatorial formula to the corresponding category of singular Soergel bimodules to obtain bases of the Hom spaces…
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…
Three pseudospectral algorithms are described (Euler, leapfrog and trapez) for solving numerically the time dependent nonlinear Schroedinger equation in one, two or three dimensions. Numerical stability regions in the parameter space are…
Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…