Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the bad points of positive semidefinite polynomials
46
0
0.0
(
0
)
Authors
Olivier Benoist
Ask ChatGPT about the research
No Arabic abstract
A bad point of a positive semidefinite real polynomial f is a point at which a pole appears in all expressions of f as a sum of squares of rational functions. We show that quartic polynomials in three variables never have bad points. We give examples of positive semidefinite polynomials with a bad point at the origin, that are nevertheless sums of squares of formal power series, answering a question of Brumfiel. We also give an example of a positive semidefinite polynomial in three variables with a complex bad point that is not real, answering a question of Scheiderer.
rate research
Read More
The image of the cone of positive semidefinite matrices under a linear map is a convex cone. Pataki characterized the set of linear maps for which that image is not closed. The Zariski closure of this set is a hypersurface in the Grassmannian. Its components are the coisotropic hypersurfaces of symmetric determinantal varieties. We develop the convex algebraic geometry of such bad projections, with focus on explicit computations.
We compute the Hodge polynomials for the moduli space of representations of an elliptic curve with two marked points into SL(2,C). When we fix the conjugacy classes of the representations around the marked points to be diagonal and of modulus one, the character variety is diffeomorphic to the moduli space of strongly parabolic Higgs bundles, whose Betti numbers are known. In that case we can recover some of the Hodge numbers of the character variety. We extend this result to the moduli space of doubly periodic instantons.
The generalized Narayana polynomials $N_{n,m}(x)$ arose from the study of infinite log-concavity of the Boros-Moll polynomials. The real-rootedness of $N_{n,m}(x)$ had been proved by Chen, Yang and Zhang. They also showed that when $ngeq m+2$, each of the generalized Narayana polynomials has one and only one positive zero and $m$ negative zeros, where the negative zeros of $N_{n,m}(x)$ and $N_{n+1,m+1}(x)$ have interlacing relations. In this paper, we study the properties of the positive zeros of $N_{n,m}(x)$ for $ngeq m+2$. We first obtain a new recurrence relation for the generalized Narayana polynomials. Based on this recurrence relation, we prove upper and lower bounds for the positive zeros of $N_{n,m}(x)$. Moreover, the monotonicity of the positive zeros of $N_{n,m}(x)$ are also proved by using the new recurrence relation.
We give an elementary proof for the fact that an irreducible hyperbolic polynomial has only one pair of hyperbolicity cones.
We design a deterministic polynomial time $c^n$ approximation algorithm for the permanent of positive semidefinite matrices where $c=e^{gamma+1}simeq 4.84$. We write a natural convex relaxation and show that its optimum solution gives a $c^n$ approximation of the permanent. We further show that this factor is asymptotically tight by constructing a family of positive semidefinite matrices.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
