Metraipolis › archive › dc_2d28d46cd20f

Rank-sensitive vertex bounds for semidefinite lifts — arXiv:2610.04498

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.04498
License (as archived)
CC0-1.0
Archived
2026-10-06T13:05:15.746Z
SHA-256 of the archived text
f68c55a1fc11c3b20081a85b56bb86d883f33136e12a6a2e65cfabce58d8f349
Stable URL of this page
https://metraipolis.com/documento/dc_2d28d46cd20f

How to cite

Rank-sensitive vertex bounds for semidefinite lifts — arXiv:2610.04498 — arXiv (en), https://arxiv.org/abs/2610.04498 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2d28d46cd20f (Metraipolis archive dc_2d28d46cd20f, sha256 f68c55a1fc11c3b20081a85b56bb86d883f33136e12a6a2e65cfabce58d8f349)
BibTeX
@misc{dc2d28d46cd20f,
  title = {Rank-sensitive vertex bounds for semidefinite lifts — arXiv:2610.04498},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.04498},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2d28d46cd20f; sha256 f68c55a1fc11c3b20081a85b56bb86d883f33136e12a6a2e65cfabce58d8f349},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.04498. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study how the ranks of factors in a positive semidefinite slack factorization constrain its size. We bound the number of low-rank vertex factors in any fixed factorization, and use this to determine the asymptotic order of the minimum factorization size under any fixed bound on vertex-factor ranks: $\Theta(n\log n)$ for permutahedra $\Pi_n$ and $\Theta(\log N)$ for regular $N$-gons. In the rank-one case this gives the order of the minimum dimension of a space of real functions on the vertices in which every facet slack is a sum of squares, with no symmetry or degree restriction. For unrestricted lifts, the bound gives $\mathrm{xc}_{\mathrm{PSD}}(\Pi_n)\ge n+\log_3 n-O(1)$, and shows that a permutahedron factorization of linear size would need vertex factors of rank $\Omega(\log n)$ at all but a vanishing fraction of vertices. We also prove that every polytope of real positive semidefinite rank at most four has at most twelve vertices, and construct explicit size-four lifts for every square-symmetric octagon, so eight is attained. The upper bound combines a count of the polygon corners reached by curves of rank-one factors with incidence constraints on factor ranks. Whether eight is the maximum remains open.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC) ; Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2610.04498 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-06T11:21:31.886Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).