Three-dimensional polyhedra can be described by three polynomial inequalities (Q2391196)

The authors show that every convex polygon in \(\mathbb{R}^2\) and every convex polyhedron in \(\mathbb{R}^3\), bounded or unbounded, can be fully described by two or three polynomial inequalities, respectively. This confirms, for dimensions \(d=2\) and \(3\), a conjecture in [\textit{H. Bosse, M. Grötschel} and \textit{M. Henk}, Math. Program. 103, No.~1 (A), 35--44 (2005; Zbl 1140.90528)], according to which every convex \(d\)-polytope in \(\mathbb{R}^d\) can be represented by \(d\) polynomial inequalities.