Symbolic products of matrices and their transposes always have non-negative eigenvalues for every matrix assignment precisely when they satisfy a graph-theoretic condition that makes the decision problem decidable.
OUP Oxford, 2004
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A characterization for positive semi-definite matrix products
Symbolic products of matrices and their transposes always have non-negative eigenvalues for every matrix assignment precisely when they satisfy a graph-theoretic condition that makes the decision problem decidable.