Nonnegative rank of a matrix with one negative eigenvalue
Abstract
We show that a rank-three symmetric matrix with exactly one negative eigenvalue can have arbitrarily large nonnegative rank.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.