Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6424474 | Journal of Combinatorial Theory, Series A | 2014 | 7 Pages |
Abstract
We provide a nontrivial upper bound for the nonnegative rank of rank-three matrices which allows us to prove that â6n/7â linear inequalities suffice to describe a convex n-gon up to a linear projection.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yaroslav Shitov,