Guardado en:
Detalles Bibliográficos
Autores principales: Fallat, Shaun, Mondal, Samir, Sendov, Hristo
Formato: Preprint
Publicado: 2026
Materias:
Acceso en línea:https://arxiv.org/abs/2605.08101
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866911663947513856
author Fallat, Shaun
Mondal, Samir
Sendov, Hristo
author_facet Fallat, Shaun
Mondal, Samir
Sendov, Hristo
contents In this framework, the extremal case corresponds to the tightest nontrivial relaxation in this hierarchy, in which every proper principal submatrix is constrained to be positive semidefinite, while the global positive semidefiniteness condition is governed by the determinant. In this paper, we study the determinants of locally positive semidefinite matrices and derive sharp lower bounds on their determinants that quantify the gap between local and global positive semidefiniteness. We further obtain analogous extensions of classical determinant inequalities, including Fisher and Koteljanskii inequalities, providing tight lower bounds in each case. In a sense, these results quantify, via determinant bounds, how far the class of locally positive semidefinite matrices can be from being positive semidefinite.
format Preprint
id arxiv_https___arxiv_org_abs_2605_08101
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Determinant Bounds for $(n-1)$-Locally Positive Semidefinite Matrices
Fallat, Shaun
Mondal, Samir
Sendov, Hristo
Optimization and Control
15A15, 15A18, 15B48
In this framework, the extremal case corresponds to the tightest nontrivial relaxation in this hierarchy, in which every proper principal submatrix is constrained to be positive semidefinite, while the global positive semidefiniteness condition is governed by the determinant. In this paper, we study the determinants of locally positive semidefinite matrices and derive sharp lower bounds on their determinants that quantify the gap between local and global positive semidefiniteness. We further obtain analogous extensions of classical determinant inequalities, including Fisher and Koteljanskii inequalities, providing tight lower bounds in each case. In a sense, these results quantify, via determinant bounds, how far the class of locally positive semidefinite matrices can be from being positive semidefinite.
title Determinant Bounds for $(n-1)$-Locally Positive Semidefinite Matrices
topic Optimization and Control
15A15, 15A18, 15B48
url https://arxiv.org/abs/2605.08101