Related papers: Reverse Chv\'atal-Gomory rank
The reverse split rank of an integral polyhedron P is defined as the supremum of the split ranks of all rational polyhedra whose integer hull is P. Already in R^3 there exist polyhedra with infinite reverse split rank. We give a geometric…
Split rank of a rational polyhedron is finite. The well known proof of this is based on the fact that split closure is stronger than the Chv\'{a}tal closure, and the Chv\'{a}tal rank of a rational polyhedron is finite due to the result of…
Given an integral polyhedron P and a rational polyhedron Q living in the same n-dimensional space and containing the same integer points as P, we investigate how many iterations of the Chv\'atal-Gomory closure operator have to be performed…
We define a new cutting plane closure for pure integer programs called the two-halfspace closure. It is a natural generalization of the well-known Chv\'atal-Gomory closure. We prove that the two-halfspace closure is polyhedral. We also…
For a polytope P, the Chvatal closure P' is obtained by simultaneously strengthening all feasible inequalities cx <= b (with integral c) to cx <= floor(b). The number of iterations of this procedure that are needed until the integral hull…
Many practical integer programming problems involve variables with one or two-sided bounds. Dunkel and Schulz (2012) considered a strengthened version of Chvatal-Gomory (CG) inequalities that use 0-1 bounds on variables, and showed that the…
Let $S \subseteq \{0,1\}^n$ and $R$ be any polytope contained in $[0,1]^n$ with $R \cap \{0,1\}^n = S$. We prove that $R$ has bounded Chv\'atal-Gomory rank (CG-rank) provided that $S$ has bounded notch and bounded gap, where the notch is…
We define an abstract regular polytope to be internally self-dual if its self-duality can be realized as one of its symmetries. This property has many interesting implications on the structure of the polytope, which we present here. Then,…
We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal…
A polyhedron is pointed if it contains at least one vertex. Every pointed polyhedron P in R^n can be described by an H-representation consisting of half spaces or equivalently by a V-representation consisting of the convex hull of a set of…
It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…
In this paper, we show that the Chvatal-Gomory closure of a compact convex set is a rational polytope. This resolves an open question discussed in Schrijver [Schrijver 80'] and generalizes the same result for the case of rational polytopes…
Let W be a finite reflection group acting orthogonally on R^n, P be the Chevalley polynomial mapping determined by an integrity basis of the algebra of W-invariant polynomials, and h be the highest degree of the coordinate polynomials in…
Recently Schrijver's open problem, whether the Chv\'atal--Gomory closure of an irrational polytope is polyhedral was answered independently in the affirmative by Dadush, Dey, and Vielma (even for arbitrarily compact convex set) as well as…
A rational polytope is the convex hull of a finite set of points in $\R^d$ with rational coordinates. Given a rational polytope $P \subseteq \R^d$, Ehrhart proved that, for $t\in\Z_{\ge 0}$, the function $#(tP \cap \Z^d)$ agrees with a…
We study the complexity of computing the mixed-integer hull $\operatorname{conv}(P\cap\mathbb{Z}^n\times\mathbb{R}^d)$ of a polyhedron $P$. Given an inequality description, with one integer variable, the mixed-integer hull can have…
We propose a variant of the Chvatal-Gomory procedure that will produce a sufficient set of facet normals for the integer hulls of all polyhedra {xx : Ax <= b} as b varies. The number of steps needed is called the small Chvatal rank (SCR) of…
Let $\Phi$ be a finite crystallographic irreducible root system and $\mathcal P_{\Phi}$ be the convex hull of the roots in $\Phi$. We give a uniform explicit description of the polytope $\mathcal P_{\Phi}$, analyze the…
We define certain natural finite sums of $n$'th roots of unity, called $G_P(n)$, that are associated to each convex integer polytope $P$, and which generalize the classical $1$-dimensional Gauss sum $G(n)$ defined over $\mathbb Z/ {n…
In this paper, we present upper bounds for the depth of some classes of polyhedra, including: polyhedra with finite fundamental group, polyhedra $P$ with abelian or free $\pi_1(P)$ and finitely generated $H_i(tilde{P};\mathbb{Z}$,…