首页/论文/math/0203268

arXiv math/02032682002-03math.MGmath.OC

On the representation of polyhedra by polynomial inequalities

Martin Grötschel, Martin Henk

备注：: 19 pages, 4 figures; revised version with minor changes proposed by the referees

英文摘要：

A beautiful result of Bröcker and Scheiderer on the stability index of basic closed semi-algebraic sets implies, as a very special case, that every $d$-dimensional polyhedron admits a representation as the set of solutions of at most $d(d+1)/2$ polynomial inequalities. Even in this polyhedral case, however, no constructive proof is known, even if the quadratic upper bound is replaced by any bound depending only on the dimension. Here we give, for simple polytopes, an explicit construction of polynomials describing such a polytope. The number of used polynomials is exponential in the dimension, but in the 2- and 3-dimensional case we get the expected number $d(d+1)/2$.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Polynomial inequalities representing polyhedra

Our main result is that every n-dimensional polytope can be described by at most (2n-1) polynomial inequalities and, moreover, these polynomials can explicitly be constructed. For an n-dimensional pointed polyhedral cone we prove the bound 2n-2 and for arbitrary polyhedra we get a constructible representation by 2n polynomial inequalities.

2003-07-14math.AGmath.MGmath.OC

Three-dimensional polyhedra can be described by three polynomial inequalities

Bosse et al. conjectured that for every natural number $d \ge 2$ and every $d$-dimensional polytope $P$ in $\real^d$ there exist $d$ polynomials $p_0(x),...,p_{d-1}(x)$ satisfying $P=\{x \in \mathbb{R}^d : p_0(x) \ge 0, >..., p_{d-1}(x) \ge 0 \}.$ We show that for dimensions $d \le 3$ even every $d$-dimensional polyhedron can be described by $d$ polynomial inequalities. The proof of our result is constructive.

2008-07-14math.AGmath.MG

A simple proof of tail--polynomial bounds on the diameter of polyhedra

Let $Δ(d,n)$ denote the maximum diameter of a $d$-dimensional polyhedron with $n$ facets. In this paper, we propose a unified analysis of a recursive inequality about $Δ(d,n)$ established by Kalai and Kleitman in 1992. This yields much simpler proofs of a tail--polynomial and tail--almost--linear bounds on $Δ(d,n)$ which are recently discussed by Gallagher and Kim.

2016-04-15math.MGmath.OC

Software for Exact Integration of Polynomials over Polyhedra

We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software implementation and provide benchmark computations. The computation of integrals of polynomials over polyhedral regions has many applications; here we demonstrate our algorithmic tools solving a challenge from combinatorial voting theory.

2012-04-02math.MG

Random ball-polyhedra and inequalities for intrinsic volumes

We prove a randomized version of the generalized Urysohn inequality relating mean-width to the other intrinsic volumes. To do this, we introduce a stochastic approximation procedure that sees each convex body K as the limit of intersections of Euclidean balls of large radii and centered at randomly chosen points. The proof depends on a new isoperimetric inequality for the intrinsic volumes of such intersections. If the centers are i.i.d. and sampled according to a bounded continuous distribution, then the extremizing measure is uniform on a Euclidean ball. If one additionally assumes that the …

2016-06-29math.MG

A quasi-polynomial bound for the diameter of graphs of polyhedra

The diameter of the graph of a $d$-dimensional polyhedron with $n$ facets is at most $n^{\log d+2}$

1992-04-01math.COmath.MG

更多相关论文收起更多论文

On the complements of 3-dimensional convex polyhedra as polynomial images of ${\mathbb R}^3$

We prove that the complement ${\mathcal S}:={\mathbb R}^3\setminus{\mathcal K}$ of a 3-dimensional convex polyhedron ${\mathcal K}\subset{\mathbb R}^3$ and its closure $\overline{\mathcal S}$ are polynomial images of ${\mathbb R}^3$. The former techniques cannot be extended in general to represent such semialgebraic sets ${\mathcal S}$ and $\overline{\mathcal S}$ as polynomial images of ${\mathbb R}^n$ if $n\geq4$.

2014-03-07math.AGmath.MG

Injective Convex Polyhedra

It was shown by Nachbin in 1950 that an $n$-dimensional normed space $X$ is injective or equivalently is an absolute 1-Lipschitz retract if and only if $X$ is linearly isometric to $l_\infty^n$ (i.e., $\mathbb{R}^n$ endowed with the $l_{\infty}$-metric). We give an effective convex geometric characterization of injective convex polyhedra in $l_{\infty}^n$. As an application, we prove that if the set of solutions to a linear system of inequalities with at most two variables per inequality is non-empty, then it is injective when endowed with the $l_{\infty}$-metric.

2014-10-27math.MG

Minimal polynomial descriptions of polyhedra and special semialgebraic sets

We show that a $d$-dimensional polyhedron $S$ in $\real^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 \}$, where $p_0,...,p_{d-1}$ are appropriate polynomials. Furthermore, if an elementary closed semialgebraic set $S$ is given by polynomials $q_1,...,q_k$ and for each $x \in S$ at most $s$ of these polynomials vanish in $x$, then $S$ can be represented by $s+1$ polynomials (and by $s$ polynomials under the extra assumption that the number of points $x \in S$ in which $s$ $q_i$'s vanish is finite).

2010-02-04math.AGmath.MG

Implicit Function Theorem for systems of polynomial equations with vanishing Jacobian and its application to flexible polyhedra and frameworks

We study the existence problem for a local implicit function determined by a system of nonlinear algebraic equations in the particular case when the determinant of its Jacobian matrix vanishes at the point under consideration. We present a system of sufficient conditions that implies existence of a local implicit function as well as another system of sufficient conditions that guarantees absence of a local implicit function. The results obtained are applied to proving new and classical results on flexibility and rigidity of polyhedra and frameworks.

2000-06-19math.CAmath.MG

Sabitov polynomials for volumes of polyhedra in four dimensions

In 1996 I.Kh. Sabitov proved that the volume of a simplicial polyhedron in a 3-dimensional Euclidean space is a root of certain polynomial with coefficients depending on the combinatorial type and on edge lengths of the polyhedron only. Moreover, the coefficients of this polynomial are polynomials in edge lengths of the polyhedron. This result implies that the volume of a simplicial polyhedron with fixed combinatorial type and edge lengths can take only finitely many values. In particular, this yields that the volume of a flexible polyhedron in a 3-dimensional Euclidean space is constant. Unti…

2011-10-22math.AGmath.COmath.MG

A note on Sobolev type inequalities on graphs with polynomial volume growth

We prove a scale of generalized $L^p$-Poincaré inequalities and Sobolev type inequalities on graphs with polynomial volume growth. They are optimal on Vicsek graphs.

2019-02-07math.FAmath.MG