Minimal polynomial descriptions of polyhedra and special semialgebraic sets

Gennadiy Averkov, Ludwig Bröcker

We show that a $d$-dimensional polyhedron $S$ in ${\Re }^d$ can be represented by $d$-polynomial inequalities, that is, $S = \{x \in \real^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge 0 \…