• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Article

An upper bound for nonnegative rank

Journal of Combinatorial Theory, Series A. 2014. Vol. 122. P. 126-132.

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.