English

Theta rank, levelness, and matroid minors

Combinatorics 2016-11-04 v3 Optimization and Control

Abstract

The Theta rank of a finite point configuration VV is the maximal degree necessary for a sum-of-squares representation of a non-negative linear function on VV. This is an important invariant for polynomial optimization that is in general hard to determine. We study the Theta rank and levelness, a related discrete-geometric invariant, for matroid base configurations. It is shown that the class of matroids with bounded Theta rank or levelness is closed under taking minors. This allows for a characterization of matroids with bounded Theta rank or levelness in terms of forbidden minors. We give the complete (finite) list of excluded minors for Theta-11 matroids which generalizes the well-known series-parallel graphs. Moreover, the class of Theta-11 matroids can be characterized in terms of the degree of generation of the vanishing ideal and in terms of the psd rank for the associated matroid base polytope. We further give a finite list of excluded minors for kk-level graphs and matroids and we investigate the graphs of Theta rank 22.

Keywords

Cite

@article{arxiv.1408.1262,
  title  = {Theta rank, levelness, and matroid minors},
  author = {Francesco Grande and Raman Sanyal},
  journal= {arXiv preprint arXiv:1408.1262},
  year   = {2016}
}

Comments

22 pages, 11 figures, minor changes, accepted for publication in JCTB

R2 v1 2026-06-22T05:21:42.454Z