Polynomial inequalities representing polyhedra

Mathematics – Metric Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

9 pages

Scientific paper

Our main result is that every n-dimensional polytope can be described by at
most (2n-1) polynomial inequalities and, moreover, these polynomials can
explicitly be constructed. For an n-dimensional pointed polyhedral cone we
prove the bound 2n-2 and for arbitrary polyhedra we get a constructible
representation by 2n polynomial inequalities.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Polynomial inequalities representing polyhedra does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Polynomial inequalities representing polyhedra, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Polynomial inequalities representing polyhedra will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-381999

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.