Related papers: Solving Virasoro Constraints in Matrix Models
We introduce the parametric matroid one-interdiction problem. Given a matroid, each element of its ground set is associated with a weight that depends linearly on a real parameter from a given parameter interval. The goal is to find, for…
We calculate genus one corrections to Hermitian one-matrix model solution with arbitrary number of cuts directly from the loop equation confirming the answer previously obtained from algebro-geometrical considerations and generalizing it to…
A special class of solutions to the generalised WDVV equations related to a finite set of covectors is investigated. Some geometric conditions on such a set which guarantee that the corresponding function satisfies WDVV equations are found…
In this paper, we present a generic parametrization of generically zero-dimensional parametric polynomial systems. More specifically, we study the specialization properties of the Rational Univariate Representation and derive bounds on the…
We propose a very general construction of simple Virasoro modules generalizing and including both highest weight and Whittaker modules. This reduces the problem of classification of simple Virasoro modules which are locally finite over a…
Using new explicit formulas for the stationary GW/PT descendent correspondence for nonsingular projective toric 3-folds, we show that the correspondence intertwines the Virasoro constraints in Gromov-Witten theory for stable maps with the…
Solving polynomial equations is a subtask of polynomial optimization. This article introduces systems of such equations and the main approaches for solving them. We discuss critical point equations, algebraic varieties, and solution counts.…
We consider the problem of approximating the solution of variational problems subject to the constraint that the admissible functions must be convex. This problem is at the interface between convex analysis, convex optimization, variational…
Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…
The moment-sum of squares hierarchy by Lasserre has become an established technique for solving polynomial optimization problems. It provides a monotonically increasing series of tight bounds, but has well-known scalability limitations. For…
We introduce and compare new compression approaches to obtain regularized solutions of large linear systems which are commonly encountered in large scale inverse problems. We first describe how to approximate matrix vector operations with a…
We provide a sparse version of the bounded degree SOS hierarchy BSOS [7] for polynomial optimization problems. It permits to treat large scale problems which satisfy a structured sparsity pattern. When the sparsity pattern satisfies the…
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
This paper concerns the reconstruction of possibly complex-valued coefficients in a second-order scalar elliptic equation posed on a bounded domain from knowledge of several solutions of that equation. We show that for a sufficiently large…
{\sc Vertex $(s, t)$-Cut} and {\sc Vertex Multiway Cut} are two fundamental graph separation problems in algorithmic graph theory. We study matroidal generalizations of these problems, where in addition to the usual input, we are given a…
We follow a stream of the history of positive matrices and positive functionals, as applied to algebraic sums of squares decompositions, with emphasis on the interaction between classical moment problems, function theory of one or several…
We study sets defined as the intersection of a rank-1 constraint with different choices of linear side constraints. We identify different conditions on the linear side constraints, under which the convex hull of the rank-1 set is polyhedral…
The usual approach to model reduction for parametric partial differential equations (PDEs) is to construct a linear space $V_n$ which approximates well the solution manifold $\mathcal{M}$ consisting of all solutions $u(y)$ with $y$ the…
We argue that restricted Schur polynomials provide a useful parameterization of the complete set of gauge invariant variables of multi-matrix models. The two point functions of restricted Schur polynomials are evaluated exactly in the free…
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…