Orthant polyhedra
Nikolay Pechenkin
Abstract
Nikolay Pechenkin
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.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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.
Key concepts: Orthant, Polyhedron, Polytope, Mathematics, Combinatorics, Section (typography), Computer science, Operating system