Three-dimensional polyhedra can be described by three polynomial inequalities

DOI10.1007/S00454-009-9183-1zbMATH Open1183.52009arXiv0807.2137OpenAlexW2074397709MaRDI QIDQ2391196FDOQ2391196

Authors: Gennadiy Averkov, Martin Henk 

Publication date: 24 July 2009

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: Bosse et al. conjectured that for every natural number $dge2$ and every $d$-dimensional polytope $P$ in $ea{l}^d$ there exist $d$ polynomials $p_0(x),\mathrm{...},p_{d-1}(x)$ satisfying $P=xinmathbb{R}^d:p_0(x)ge0,>\mathrm{...},p_{d-1}(x)ge0.$ We show that for dimensions $dle3$ even every $d$-dimensional polyhedron can be described by $d$ polynomial inequalities. The proof of our result is constructive.

Full work available at URL: https://arxiv.org/abs/0807.2137

Recommendations

• scientific article; zbMATH DE number 5956571
• Polynomial inequalities representing polyhedra
• The representation of polyhedra by polynomial inequalities
• Representing simple \(d\)-dimensional polytopes by \(d\) polynomials
• Description of polygonal regions by polynomials of bounded degree

zbMATH Keywords

polytopepolynomialsemi-algebraic setŁojasiewicz's inequalitytheorem of Bröcker and Scheiderer

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Convex sets in (2) dimensions (including convex curves) (52A10) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (3) dimensions (including convex surfaces) (52A15)

Cites Work

• Title not available (Why is that?)
• Convex and Discrete Geometry
• Lectures on Polytopes
• Title not available (Why is that?)
• Sur le problème de la division
• Title not available (Why is that?)
• Semidefinite representation of convex sets
• Polynomial representations of polyhedra
• Polynomial inequalities representing polyhedra
• Representing simple \(d\)-dimensional polytopes by \(d\) polynomials

Cited In (5)

• Minimal polynomial descriptions of polyhedra and special semialgebraic sets
• Description of polygonal regions by polynomials of bounded degree
• Representing simple \(d\)-dimensional polytopes by \(d\) polynomials
• The representation of polyhedra by polynomial inequalities
• Polynomial inequalities representing polyhedra

This page was built for publication: Three-dimensional polyhedra can be described by three polynomial inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391196)