Do sums of squares dream of free resolutions?
From MaRDI portal
Publication:5347299
Abstract: We associate to a real projective variety two convex cones which are fundamental in real algebraic geometry: the cone of quadratic forms nonnegative on , and the cone of sums of squares of linear forms. The dual cone is a spectrahedron and we show that its convexity properties are closely related to homological properties of . For instance, we show that all extreme rays of have rank one if and only if X has Castelnuovo-Mumford regularity two. More generally, if has an extreme ray of rank , then does not satisfy the property . We show that the converse also holds in a wide variety of situations: the smallest for which property does not hold is equal to the smallest rank of an extreme ray of greater than one. These results allow us to generalize the work of Blekherman-Smith-Velasco on equality of nonnegative polynomials and sums of squares from irreducible varieties to reduced schemes and to classify all spectrahedral cones with only rank one extreme rays. Our results have applications to the positive semidefinite matrix completion problem and to the truncated moment problem on projective varieties.
Recommendations
Cites work
- scientific article; zbMATH DE number 4097538 (Why is no real title available?)
- scientific article; zbMATH DE number 16165 (Why is no real title available?)
- scientific article; zbMATH DE number 3572315 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- A new graph parameter related to bounded rank positive semidefinite matrix completions
- A simpler proof of the Gieseker-Petri theorem on special divisors
- Analysis on some infinite modules, inner projection, and applications
- Approximating Positive Polynomials Using Sums of Squares
- Extremal positive semidefinite matrices whose sparsity pattern is given by graphs without \(K_{5}\) minors
- Gap vectors of real projective varieties
- Geometry of maximum likelihood estimation in Gaussian graphical models
- Green's conjecture for the generic r-gonal curve of genus g 3r-7.
- Green's generic syzygy conjecture for curves of even genus lying on a \(K3\) surface
- Koszul homology and syzygies of Veronese subalgebras
- Lattice polygons and Green’s theorem
- Low-rank sum-of-squares representations on varieties of minimal degree
- Moments, positive polynomials and their applications
- Nonnegative polynomials and sums of squares
- On syzygies of Veronese embedding of arbitrary projective varieties
- On the sparsity order of a graph and its deficiency in chordality
- Positive Gorenstein ideals
- Positive definite completions of partial Hermitian matrices
- Positive semidefinite matrices with a given sparsity pattern
- Restricting linear syzygies: algebra and geometry
- Schur products and matrix completions
- Semidefinite Optimization and Convex Algebraic Geometry
- Small schemes and varieties of minimal degree
- Some geometric results in semidefinite programming
- Some results on rational surfaces and Fano varieties
- Spectrahedral cones generated by rank \(1\) matrices
- Sums of squares and varieties of minimal degree
- The Geometry of Syzygies
- The Ranks of Extremal Positive Semidefinite Matrices with Given Sparsity Pattern
- The real positive semidefinite completion problem for series-parallel graphs
- The regularity of Tor and graded Betti Numbers
- green's canonical syzygy conjecture for generic curves of odd genus
Cited in
(15)- Sums of squares and quadratic persistence on real projective varieties
- Algebraic geometry and sums of squares
- On the Lefschetz property for quotients by monomial ideals containing squares of variables
- Sums of squares: a real projective story
- Limitations on the Expressive Power of Convex Cones without Long Chains of Faces
- Gap vectors of real projective varieties
- Sums of squares, Hankel index, and almost real rank
- Strictly positive polynomials in the boundary of the SOS cone
- Extreme rays of Hankel spectrahedra for ternary forms
- Harmonic Hierarchies for Polynomial Optimization
- Terracini convexity
- Sum of squares decomposition of positive polynomials with rational coefficients
- Memory-efficient structured convex optimization via extreme point sampling
- Sums of squares and sparse semidefinite programming
- Maximum likelihood threshold and generic completion rank of graphs
This page was built for publication: Do sums of squares dream of free resolutions?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5347299)