Degree of Central Curve in Quadratic Programming
summary
Degree of the complex central curve for generic quadratic programs equals the mixed-volume count given by the polytope support formula: degree = sum_{k=0}^d 2^k C(n-1-k, d-k), which recovers C(n-1,d) for the linear case. Proof uses mixed-volume count of a Cayley polytope, a homotopy to diagonal Q to reduce generic symmetric Q to diagonal entries, and computational verification via Gröbner elimination checks* and a completed degree table for many (n,d).
AI-written summary · about