Representing simple d-dimensional polytopes by d polynomials
From MaRDI portal
Publication:623364
DOI10.1007/S10107-009-0280-YzbMATH Open1210.52007arXiv0709.2099OpenAlexW1975436244MaRDI QIDQ623364FDOQ623364
Authors: Gennadiy Averkov, Martin Henk 
Publication date: 14 February 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Abstract: A polynomial representation of a convex d-polytope P is a finite set {p_1(x),...,p_n(x)} of polynomials over E^d such that P=setcond{x in E^d}{p_1(x) ge 0 {for every} 1 le i le n}. By s(d,P) we denote the least possible number of polynomials in a polynomial representation of P. It is known that d le s(d,P) le 2d-1. Moreover, it is conjectured that s(d,P)=d for all convex d-polytopes P. We confirm this conjecture for simple d-polytopes by providing an explicit construction of d polynomials that represent a given simple d-polytope P.
Full work available at URL: https://arxiv.org/abs/0709.2099
Recommendations
- The representation of polyhedra by polynomial inequalities
- scientific article; zbMATH DE number 5956571
- Polynomial inequalities representing polyhedra
- Minimal polynomial descriptions of polyhedra and special semialgebraic sets
- Three-dimensional polyhedra can be described by three polynomial inequalities
(n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lectures on Polytopes
- Title not available (Why is that?)
- Representing polynomials by positive linear functions on compact convex polyhedra
- Algorithms in real algebraic geometry
- Title not available (Why is that?)
- Title not available (Why is that?)
- On basic semialgebraic sets
- Stability index of real varieties
- Minimale Erzeugung von Positivbereichen
- Polynomial representations of polyhedra
- Title not available (Why is that?)
- Approximating convex bodies by algebraic ones
- Reducing inequalities with bounds
- The representation of polyhedra by polynomial inequalities
- Polynomial inequalities representing polyhedra
- Algebraic surfaces: with appendices by S. S. Abhyankar, J. Lipman and D. Mumford.
- Three-dimensional polyhedra can be described by three polynomial inequalities
- Title not available (Why is that?)
- Approximation of convex surfaces by algebraic surfaces
Cited In (10)
- On polytopes that are simple at the edges
- Reproducing kernel Hilbert spaces for parametric partial differential equations
- Minimal polynomial descriptions of polyhedra and special semialgebraic sets
- Polynomial representations of polyhedra
- Fleck's congruence, associated magic squares and a zeta identity
- Simple 0/1-polytopes
- Title not available (Why is that?)
- The representation of polyhedra by polynomial inequalities
- Polynomial inequalities representing polyhedra
- Three-dimensional polyhedra can be described by three polynomial inequalities
Uses Software
This page was built for publication: Representing simple \(d\)-dimensional polytopes by \(d\) polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623364)
