Related papers: Numerical Schubert Calculus via the Littlewood-Ric…
We give lower bounds for the numbers of real solutions in problems appearing in Schubert calculus in the Grassmannian Gr(n,d) related to osculating flags. It is known that such solutions are related to Bethe vectors in the Gaudin model…
While automatically generated polynomial elimination templates have sparked great progress in the field of 3D computer vision, there remain many problems for which the degree of the constraints or the number of unknowns leads to…
In this paper, we propose new algorithms for finding a common point of the solution set of a pseudomonotone equilibrium problem and the set of fixed points of a symmetric generalized hybrid mapping in a real Hilbert space. The convergence…
In this paper, we present a fast and accurate numerical scheme for the solution of fifth-order boundary-value problems. We apply the reproducing kernel Hilbert space method (RKHSM) for solving this problem. The analytic results of the…
A fast and accurate numerical method for the solution of scalar and matrix Wiener--Hopf problems is presented. The Wiener--Hopf problems are formulated as Riemann--Hilbert problems on the real line, and a numerical approach developed for…
The computation of Kronecker coefficients is a challenging problem with a variety of applications. In this paper we present an approach based on methods from symplectic geometry and residue calculus. We outline a general algorithm for the…
It is shown that the natural framework for the solutions of any Schrodinger equation whose spectrum has a continuous part is the Rigged Hilbert Space rather than just the Hilbert space. The difficulties of using only the Hilbert space to…
We find a local $(d+1) \times (d+1)$ Riemann-Hilbert problem characterizing the skew-orthogonal polynomials associated to the partition function of the Gaussian Orthogonal Ensemble of random matrices with a potential function of degree $d$.…
In this tutorial, we provide an overview of many of the established combinatorial and algebraic tools of Schubert calculus, the modern area of enumerative geometry that encapsulates a wide variety of topics involving intersections of linear…
Using a map between the Lindbladian evolution of dephasing in free fermions and the time evolution of imaginary-interaction Fermi-Hubbard models in bipartite lattices, we present an efficient classical algorithm to solve the Schr\"{o}dinger…
We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…
We resolve a basic problem on subspace distances that often arises in applications: How can the usual Grassmann distance between equidimensional subspaces be extended to subspaces of different dimensions? We show that a natural solution is…
We investigate the problem of computing tensor product multiplicities for complex semisimple Lie algebras. Even though computing these numbers is #P-hard in general, we show that if the rank of the Lie algebra is assumed fixed, then there…
The radial Schrodinger equation for a spherically symmetric potential can be regarded as a one dimensional classical harmonic oscillator with a time-dependent spring constant. For solving classical dynamics problems, symplectic integrators…
We consider the leapfrog algorithm by Noakes for computing geodesics on Riemannian manifolds. The main idea behind this algorithm is to subdivide the original endpoint geodesic problem into several local problems, for which the endpoint…
Many applications modeled by polynomial systems have positive dimensional solution components (e.g., the path synthesis problems for four-bar mechanisms) that are challenging to compute numerically by homotopy continuation methods. A…
This article develops a new predictor-corrector algorithm for numerical path tracking in the context of polynomial homotopy continuation. In the corrector step it uses a newly developed Newton corrector algorithm which rejects an initial…
This chapter concerns edge labeled Young tableaux, introduced by H. Thomas and the third author. It is used to model equivariant Schubert calculus of Grassmannians. We survey results, problems, conjectures, together with their influences…
The Lindblad equation generalizes the Schr\"{o}dinger equation to quantum systems that undergo dissipative dynamics. The quantum simulation of Lindbladian dynamics is therefore non-unitary, preventing a naive application of state-of-the-art…
We introduce a Littlewood-Richardson rule based on an algorithmic deformation of skew Young diagrams and present a bijection with the classical rule. The result is a direct combinatorial interpretation and proof of the geometric rule…