SDP Feasibility Problems and sos Representation Ranks for OT-FKM Type Isoparametric Polynomials
Differential Geometry
2026-03-24 v1 Algebraic Geometry
Optimization and Control
Abstract
Semidefinite programming (SDP) provides a fundamental framework for studying properties of sum-of-squares (sos) representations of nonnegative polynomials. In this paper we study the quartic forms GF = (|x|^4 + F(x))/2 associated with isoparametric polynomials F of OT-FKM type with g = 4. We characterize the sos property of GF in terms of the feasibility of an explicit SDP determined by the underlying Clifford system, and in the sos cases we obtain quantitative rank bounds for sos representations, with rigidity when m >= 3.
Keywords
Cite
@article{arxiv.2603.21241,
title = {SDP Feasibility Problems and sos Representation Ranks for OT-FKM Type Isoparametric Polynomials},
author = {Jianquan Ge and Kai Jia and Yuyang Zhao},
journal= {arXiv preprint arXiv:2603.21241},
year = {2026}
}
Comments
51 pages, no figures