Nonnegative rank of a matrix with one negative eigenvalue
Combinatorics
2013-08-23 v1
Abstract
We show that a rank-three symmetric matrix with exactly one negative eigenvalue can have arbitrarily large nonnegative rank.
Keywords
Cite
@article{arxiv.1308.4716,
title = {Nonnegative rank of a matrix with one negative eigenvalue},
author = {Yaroslav Shitov},
journal= {arXiv preprint arXiv:1308.4716},
year = {2013}
}
Comments
note, 1 page