The Algebraic Boundary of Graph Elliptopes
Abstract
This paper studies the algebraic boundary of the elliptope of a graph . In particular, we completely characterize the algebraic boundary of when is cycle completable. In this case, the boundary is a union of determinantal hypersurfaces and Lissajous varieties, i.e., images of rational linear subspaces under the coordinatewise cosine map. As an application, we show that the algebraic boundary of is disjoint from its interior precisely when is a spectrahedron or, equivalently, when is a chordal graph. A central ingredient for the defining equation of the boundary hypersurface is the cycle polynomial, which captures the algebraic boundary of the elliptope of the -th cycle graph . We show that the cycle polynomial of is the resultant of two smaller cycle polynomials. Via this result, Sylvester's determinantal formula offers an inductive method for computing the cycle polynomial which mirrors a geometric property of metric polytopes. We also determine the degree of the homogeneous cycle polynomial, settling an open question of Sturmfels and Uhler (2010).
Cite
@article{arxiv.2605.02484,
title = {The Algebraic Boundary of Graph Elliptopes},
author = {Monique Laurent and Francesco Maria Mascarin and Simon Telen},
journal= {arXiv preprint arXiv:2605.02484},
year = {2026}
}
Comments
30 pages, 4 figures