相关论文: Linear Principal Minor Polynomials: Hyperbolic Det…
Polynomial inequalities lie at the heart of many mathematical disciplines. In this paper, we consider the fundamental computational task of automatically searching for proofs of polynomial inequalities. We adopt the framework of…
We study mild solutions of a class of stochastic partial differential equations, involving operators with polynomially bounded coefficients. We consider semilinear equations under suitable hyperbolicity hypotheses on the linear part. We…
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…
Shifting by \pm 1 powers sums: p_i \to p_i \pm 1 induces a transformation on symmetric functions that we detail in the case of Hall-Littlewood polynomials. By iteration, this gives a description of these polynomials in terms of plane…
We develop several combinatorial notions about laminations, some with clear implications for parameter space. We introduce a simplified class of laminations called finite dynamical laminations (FDL). In order to count FDL, we introduce…
In the first part of this paper, the main concern is with smoothness properties of the boundary of the pseudospectrum of a matrix polynomial. In the second part, results are obtained concerning the number of connected components of…
Any homogeneous harmonic polynomial can be decomposed as a sum of powers of isotropic linear forms, that is, linear forms whose coefficients are the coordinates of isotropic points. The minimum size of such decompositions for a harmonic…
Given a symmetric polynomial $P$ in $2n$ variables, there exists a unique symmetric polynomial $Q$ in $n$ variables such that \[ P(x_1,\ldots,x_n,x_1^{-1},\ldots,x_n^{-1}) =Q(x_1+x_1^{-1},\ldots,x_n+x_n^{-1}). \] We denote this polynomial…
The equivalence of multidimensional systems is closely related to the reduction of multivariate polynomial matrices, with the Smith normal form of matrices playing a key role. So far, the problem of reducing multivariate polynomial matrices…
We study the r-th elementary symmetric polynomial in $n$ variables with 2<r<n. There are two kinds of linear transformations on the parameter space that leave this polynomial invariant: Namely, any permutation of the variables and…
Majorization inequalities for symmetric polynomials have interested mathematicians for centuries, from the AM-GM inequality for two variables going back at least to Euclid, through classical results of Newton, Muirhead and Gantmacher, to…
We introduce and study symmetric polynomials, which as very special cases include polynomials related to the supersymmetric eight-vertex model, and other elliptic lattice models with $\Delta=\pm 1/2$. There is also a close relation to…
This work concerns the distance in 2-norm from a matrix polynomial to a nearest polynomial with a specified number of its eigenvalues at specified locations in the complex plane. Perturbations are allowed only on the constant coefficient…
We consider the problem of realizing hyperbolicity cones as spectrahedra, i.e. as linear slices of cones of positive semidefinite matrices. The generalized Lax conjecture states that this is always possible. We use generalized Clifford…
According to a recent paper \cite{bopt13}, polynomials from the closure $\bar{\rm PHD}_3$ of the {\em Principal Hyperbolic Domain} ${\rm PHD}_3$ of the cubic connectedness locus have a few specific properties. The family $\mathrm{CU}$ of…
We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…
We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other relational structures) in the sense that, for each size of graph, there is an LP defining a polyhedral lift that separates the integer points…
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…
We prove some sufficient conditions implying $l^p$ inequalities of the form $||x||_p \leq ||y||_p$ for vectors $ x, y \in [0,\infty)^n$ and for $p$ in certain positive real intervals. Our sufficient conditions are strictly weaker than the…
Parametric linear systems are linear systems of equations in which some symbolic parameters, that is, symbols that are not considered to be candidates for elimination or solution in the course of analyzing the problem, appear in the…