An upper bound for nonnegative rank
Combinatorics
2013-03-11 v1
Abstract
We provide a nontrivial upper bound for the nonnegative rank of rank-three matrices, which allows us to prove that [6(n+1)/7] linear inequalities suffice to describe a convex n-gon up to a linear projection.
Keywords
Cite
@article{arxiv.1303.1960,
title = {An upper bound for nonnegative rank},
author = {Yaroslav Shitov},
journal= {arXiv preprint arXiv:1303.1960},
year = {2013}
}