Saved in:
Bibliographic Details
Main Authors: Ge, Jianquan, Jia, Kai, Zhao, Yuyang
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2603.21241
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • 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.