Related papers: Solving Virasoro Constraints in Matrix Models
Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…
We classify all simple $W_n$-modules with finite-dimensional weight spaces. Every such module is either of a highest weight type or is a quotient of a module of tensor fields on a torus, which was conjectured by Eswara Rao. This generalizes…
We propose two novel conditional gradient-based methods for solving structured stochastic convex optimization problems with a large number of linear constraints. Instances of this template naturally arise from SDP-relaxations of…
Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…
In this paper, we study the solution uniqueness of an individual feasible vector of a class of convex optimization problems involving convex piecewise affine functions and subject to general polyhedral constraints. This class of problems…
Virasoro constraints are applied to degree zero Gromov-Witten theory of weighted projective stacks $\mathbb{P}(1,N)$ and $\mathbb{P}(1,1,N)$ to obtain formulas of descendant cyclic Hurwitz-Hodge integrals in higher genera.
In this paper we present applications of methods from wavelet analysis to polynomial approximations for a number of accelerator physics problems. According to variational approach in the general case we have the solution as a…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
In the framework of the matrix model/gauge theory correspondence, we consider supersymmetric U(N) gauge theory with $U(1)^N$ symmetry breaking pattern. Due to the presence of the Veneziano--Yankielowicz effective superpotential, in order to…
We solve the problem of characterizing the existence of a polynomial matrix of fixed degree when its eigenstructure (or part of it) and some of its rows (columns) are prescribed. More specifically, we present a solution to the row (column)…
We explore systems of polynomial equations where we seek complex solutions with absolute value 1. Geometrically, this amounts to understanding intersections of algebraic varieties with tori -- Cartesian powers of the unit circle. We study…
I review some recent works on the Hermitean one-matrix and d-dimensional gauge-invariant matrix models. Special attention is paid to solving the models at large-N by the loop equations. For the one-matrix model the main result concerns…
Posynomials are nonnegative combinations of monomials with possibly fractional and both positive and negative exponents. Posynomial models are widely used in various engineering design endeavors, such as circuits, aerospace and structural…
Product forms of characters of Virasoro minimal models are obtained which factorize into $(2,\odd)\times(3,\even)$ characters. These are related by generalized Rogers-Ramanujan identities to sum forms allowing for a quasiparticle…
The solution path of the 1D fused lasso for an $n$-dimensional input is piecewise linear with $\mathcal{O}(n)$ segments (Hoefling et al. 2010 and Tibshirani et al 2011). However, existing proofs of this bound do not hold for the weighted…
We address optimization of nonlinear functions of the form $f(Wx)$, where $f:\R^d\to \R$ is a nonlinear function, $W$ is a $d\times n$ matrix, and feasible $x$ are in some large finite set $F$ of integer points in $\R^n$. One motivation is…
This is a review of ($q$-)hypergeometric orthogonal polynomials and their relation to representation theory of quantum groups, to matrix models, to integrable theory, and to knot theory. We discuss both continuous and discrete orthogonal…
We derive inclusion regions for the eigenvalues of matrix polynomials expressed in a general polynomial basis, which can lead to significantly better results than traditional bounds. We present several applications to engineering problems.
This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this problem. Our algorithm is intended only for nondegenerate…
The varying coefficient model has received broad attention from researchers as it is a powerful dimension reduction tool for non-parametric modeling. Most existing varying coefficient models fitted with polynomial spline assume equidistant…