A trace bound for integer-diagonal positive semidefinite matrices

We prove that an n-by-n complex positive semidefinite matrix of rank r whose graph is connected, whose diagonal entries are integers, and whose non-zero off-diagonal entries have modulus at least one, has trace at least n + r − 1.

Bibliographic Details
Main Author: Mitchell Lon
Format: Article
Language:English
Published: De Gruyter 2020-01-01
Series:Special Matrices
Subjects:
Online Access:https://doi.org/10.1515/spma-2020-0002