Three-dimensional polyhedra can be described by three polynomial inequalities

Gennadiy Averkov, Martin Henk

Bosse et al. conjectured that for every natural number $d\ge 2$ and every $d$-dimensional polytope $P$ in ${\Re }^d$ there exist $d$ polynomials $p_0(x),...,p_{d-1}(x)$ satisfying…