The complexity of semidefinite programs for testing k -block-positivity
Journal of Mathematical Physics · 01.11.2026 · 67 (11)
DOI: 10.1063/5.0338365 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Mathematical Physics, online erschienen am 12.11.2026. Verfasst von Qian Chen und 1 weiteren Autor:innen. Die Arbeit nennt 16 Literaturangaben.
Abstract (Originalsprache)
We extend [Q. Chen et al., arXiv:2505.22100 (2025)] by analyzing the complexity of the k-block-positivity testing algorithm that stems from the optimization problem in Definition 5. In this paper, we investigate a symmetry reduction scheme based on rectangular shaped Young diagrams. Connecting the complexity to the dimensions of irreducible representations of U(d), we derive an explicit formula for the complexity, which also clarifies why the semidefinite program hierarchy collapses in the k = d case.
Zitieren
APA
Chen, Q., & Collins, B. (2026). The complexity of semidefinite programs for testing k -block-positivity. Journal of Mathematical Physics, 67(11). https://doi.org/10.1063/5.0338365
Vancouver
Chen Q, Collins B. The complexity of semidefinite programs for testing k -block-positivity. Journal of Mathematical Physics. 2026;67(11). doi:10.1063/5.0338365
BibTeX
@article{Chen2026,
author = {Chen, Qian and Collins, Benoît},
title = {The complexity of semidefinite programs for testing k -block-positivity},
journal = {Journal of Mathematical Physics},
year = {2026},
volume = {67},
number = {11},
doi = {10.1063/5.0338365}
}
EUVIMED