Transversal numbers over subsets of linear spaces

Let $M$ be a subset of $\mathbb{R}^k$. It is an important question in the theory of linear inequalities to estimate the minimal number $h=h(M)$ such that every system of linear inequalities which is infeasible over $M$ has a subsystem of at most $h$ inequalities which is already infeasible over $M.$ This number $h(M)$ is said to be the Helly number of $M.$ In view of Helly's theorem, $h(\mathbb{R}^n)=n+1$ and, by the theorem due to Doignon, Bell and Scarf, $h(\mathbb{Z}^d)=2^d.$ We give a common extension of these equalities showing that $h(\mathbb{R}^n \times \mathbb{Z}^d) = (n+1) 2^d.$ We show that the fractional Helly number of the space $M \subseteq \mathbb{R}^d$ (with the convexity structure induced by $\mathbb{R}^d$) is at most $d+1$ as long as $h(M)$ is finite. Finally we give estimates for the Radon number of mixed integer spaces.

[1]  Noga Alon,et al.  Transversal numbers for hypergraphs arising in geometry , 2002, Adv. Appl. Math..

[2]  M. Katchalski,et al.  A problem of geometry in ⁿ , 1979 .

[3]  Herbert E. Scarf An observation on the structure of production sets with indivisibilities , 1977 .

[4]  Jiří Matoušek,et al.  A fractional Helly theorem for convex lattice sets , 2003 .

[5]  M. Katchalski,et al.  A Problem of Geometry in R n , 1979 .

[6]  Robert E. Jamison-Waldner PARTITION NUMBERS FOR TREES AND ORDERED SETS , 1981 .

[7]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[8]  V. Klee,et al.  Helly's theorem and its relatives , 1963 .

[9]  Michael Todd The Number of Necessary Constraints in an Integer Program: A New Proof of Scarf's Theorem , 1977 .

[10]  David E. Bell A Theorem Concerning the Integer Lattice , 1977 .

[11]  G. Ziegler Lectures on Polytopes , 1994 .

[12]  Van de M. L. J. Vel Theory of convex structures , 1993 .

[13]  Jean-Paul Doignon,et al.  Convexity in cristallographical lattices , 1973 .

[14]  Kenneth L. Clarkson,et al.  Las Vegas algorithms for linear and integer programming when the dimension is small , 1995, JACM.

[15]  Aart Blokhuis,et al.  The Radon Number of the Three-Dimensional Integer Lattice , 2003, Discret. Comput. Geom..

[16]  David K. Smith Theory of Linear and Integer Programming , 1987 .

[17]  K. Ball CONVEX BODIES: THE BRUNN–MINKOWSKI THEORY , 1994 .

[18]  R. Pollack,et al.  Geometric Transversal Theory , 1993 .

[19]  Shmuel Onn,et al.  On the Geometry and Computational Complexity of Radon Partitions in the Integer Lattice , 1991, SIAM J. Discret. Math..

[20]  Dimitris Bertsimas,et al.  Optimization over integers , 2005 .

[21]  Kent Andersen,et al.  Certificates of linear mixed integer infeasibility , 2008, Oper. Res. Lett..