2000 character limit reached
Orthant polyhedra (1407.5970v1)
Published 22 Jul 2014 in math.MG
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.