Polynomial representations of polyhedra

MaRDI QIDQ2468441zbMATH OpenFDO

Authors Martin Henk

Publication date 23 January 2008

Published in Jahresbericht der Deutschen Mathematiker-Vereinigung (DMV) (Search for Journal in Brave)

zbMATH Keywords

\(H\)-representation\(V\)-representationapproximationconstructionconvex polytopepolyhedral setpolynomial representationsemi-algebraic set

Mathematics Subject Classification ID

Semialgebraic sets and related spaces (14P10) (n)-dimensional polytopes (52B11)

Review text

This nice paper refers to polynomial representations of convex polyhedral sets (and, in the particular case of boundedness, convex polytopes), as they are useful, e.g., for combinatorial optimization. The author discusses problems that occur if one changes between \(V\)- and \(H\)-representations of polytopes, where the theory of semi-algebraic sets is shown to yield an important background. Many results in this direction are presented and discussed, including construction principles and first results on representations and approximations of polyhedral sets (or more general sets) via polynomial inequality systems.

Recommendations

• The representation of polyhedra by polynomial inequalities
• Polynomial inequalities representing polyhedra
• scientific article; zbMATH DE number 5956571
• Representing simple d-dimensional polytopes by d polynomials
• scientific article; zbMATH DE number 1390133
• scientific article; zbMATH DE number 3943559
• Polyhedrality and decomposition
• scientific article; zbMATH DE number 1560219
• scientific article; zbMATH DE number 2070258
• Polynomial approximation on polytopes

Cited in

(26)

• Notes on the algebra and geometry of polynomial representations
• The analysis and the representation of balanced complex polytopes in 2D
• Note on prime representations of convex polyhedral sets
• Representability of convex sets by analytical linear inequality systems.
• Three-dimensional polyhedra can be described by three polynomial inequalities
• Invariance and efficiency of convex representations
• Polyhedra related to integer-convex polynomial systems
• The linear inequalities set representation of Minkovski's sum for two polyhedrons
• Automata-based symbolic representations of polyhedra
• scientific article; zbMATH DE number 5956571 (Why is no real title available?)
• A Constructive Proof of the Representation Theorem for Polyhedral Sets Based on Fundamental Definitions
• Polyhedral representation conversion up to symmetries
• Polynomial icosahedral invariants
• Polyhedral representation of discrete Morse functions
• scientific article; zbMATH DE number 146863 (Why is no real title available?)
• scientific article; zbMATH DE number 1248192 (Why is no real title available?)
• scientific article; zbMATH DE number 1860737 (Why is no real title available?)
• Minimal polynomial descriptions of polyhedra and special semialgebraic sets
• A representation of generalized convex polyhedra and applications
• On minimal generators for semi-closed polyhedra
• Representation of Sets of Lattice Points
• A method of transferring polyhedron between the intersection-form and the sum-form
• Description of polygonal regions by polynomials of bounded degree
• Representing simple d-dimensional polytopes by d polynomials
• Hyperbolization of polyhedra
• Representing the sporadic Archimedean polyhedra as abstract polytopes

This page was built for publication: Polynomial representations of polyhedra

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