Papers
Topics
Authors
Recent
Search
2000 character limit reached

Orthant polyhedra

Published 22 Jul 2014 in math.MG | (1407.5970v1)

Abstract: An orthant polyhedron is a polyhedron with $m$ hyperfaces, that could be realized as a section of the $m$-dimensional non-negative orthant. We classify all 2-dimensional orthant polyhedra and provide some partial results towards the classification of higher dimensional orthant polyhedra. As a consequence of our results we show that every polytope could be realized as a section of the $n$-dimensional non-negative orthant with $n$ being big enough.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.