{"title":"Convex Algebraic Geometry of Curvature Operators","authors":"R. G. Bettiol, Mario Kummer, R. Mendes","doi":"10.1137/20M1350777","DOIUrl":null,"url":null,"abstract":"We study the structure of the set of algebraic curvature operators satisfying a sectional curvature bound under the light of the emerging field of Convex Algebraic Geometry. More precisely, we determine in which dimensions $n$ this convex semialgebraic set is a spectrahedron or a spectrahedral shadow; in particular, for $n\\geq5$, these give new counter-examples to the Helton--Nie Conjecture. Moreover, efficient algorithms are provided if $n=4$ to test membership in such a set. For $n\\geq5$, algorithms using semidefinite programming are obtained from hierarchies of inner approximations by spectrahedral shadows and outer relaxations by spectrahedra.","PeriodicalId":48489,"journal":{"name":"SIAM Journal on Applied Algebra and Geometry","volume":null,"pages":null},"PeriodicalIF":1.6000,"publicationDate":"2019-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIAM Journal on Applied Algebra and Geometry","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1137/20M1350777","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 9
Abstract
We study the structure of the set of algebraic curvature operators satisfying a sectional curvature bound under the light of the emerging field of Convex Algebraic Geometry. More precisely, we determine in which dimensions $n$ this convex semialgebraic set is a spectrahedron or a spectrahedral shadow; in particular, for $n\geq5$, these give new counter-examples to the Helton--Nie Conjecture. Moreover, efficient algorithms are provided if $n=4$ to test membership in such a set. For $n\geq5$, algorithms using semidefinite programming are obtained from hierarchies of inner approximations by spectrahedral shadows and outer relaxations by spectrahedra.