Related papers: Deciding positivity of multisymmetric polynomials
Functions that are piecewise defined are a common sight in mathematics while convexity is a property especially desired in optimization. Suppose now a piecewise-defined function is convex on each of its defining components - when can we…
We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…
We prove an analog of Perron-Frobenius theorem for multilinear forms with nonnegative coefficients, and more generally, for polynomial maps with nonnegative coefficients. We determine the geometric convergence rate of the power algorithm to…
We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…
We establish an invertibility criterion for free polynomials and free functions evaluated on some tuples of matrices. We show that if the derivative is nonsingular on some domain closed with respect to direct sums and similarity, the…
We ask whether every polynomial function that is non-negative on a real algebraic curve can be expressed as a sum of squares in the coordinate ring. Scheiderer has classified all irreducible curves for which this is the case. For reducible…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
Motivated by classical notions of bilinear matrix inequalities (BMIs) and partial convexity, this article investigates partial convexity for noncommutative functions. It is shown that noncommutative rational functions that are partially…
Matrix-valued polynomials in any finite number of freely noncommuting variables that enjoy certain canonical partial convexity properties are characterized, via an algebraic certificate, in terms of Linear Matrix Inequalities and Bilinear…
In an isomorphic copy of the ring of symmetric polynomials we study some families of polynomials which are indexed by rational weight vectors. These families include well known symmetric polynomials, such as the elementary, homogeneous, and…
We study structured optimization problems with polynomial objective function and polynomial equality constraints. The structure comes from a multi-grading on the polynomial ring in several variables. For fixed multi-degrees we determine the…
Reducing the conditions under which a given set satisfies the stipulations of the subset sum proposition to a set of linear relationships, the question of whether a set satisfies subset sum may be answered in a polynomial number of steps by…
In this brief note, it is shown that the function p^TW log(p) is convex in p if W is a diagonally dominant positive definite M-matrix. The techniques used to prove convexity are well-known in linear algebra and essentially involves…
We study a class of projective transformations of spectraplexes associated with self-dual cones and, on this basis, propose a polynomial-time algorithm for convex feasibility problems with positive definite constraints. At each iteration of…
In this article, we propose a geometric programming method in order to compute lower bounds for real polynomials. We provide new sufficient conditions for polynomials to be nonnegative as well as to have a sum of binomial squares…
The problem of verifying multi-threaded execution against the memory consistency model of a processor is known to be an NP hard problem. However polynomial time algorithms exist that detect almost all failures in such execution. These are…
Convexity plays a prominent role in a number of problems, but practical considerations frequently give rise to non-convex functions. We suggest a method for determining convex regions, and also for assessing the lack of convexity in the…
We provide a specific representation of convex polynomials nonnegative on a convex (not necessarily compact) basic closed semi-algebraic subset K of Rn. Namely, they belong to a specific subset of the quadratic module generated by the…
We introduce an asymptotic notion of positivity in algebraic geometry that turns out to be related to some high-dimensional convex sets. The dimension of the convex sets grows with the number of birational operations. In the case of complex…
In this paper we investigate multiple polylogarithms with non-positive multi-indices (nonpositive MPLs) from a combinatorial and algebraic viewpoint. By introducing a correspondence between non-positive multiple polylogarithms and Magnus…