DeepAI AI Chat
Log In Sign Up

New Bounds for the Vertices of the Integer Hull

by   Sebastian Berndt, et al.

The vertices of the integer hull are the integral equivalent to the well-studied basic feasible solutions of linear programs. In this paper we give new bounds on the number of non-zero components – their support – of these vertices matching either the best known bounds or improving upon them. While the best known bounds make use of deep techniques, we only use basic results from probability theory to make use of the concentration of measure effect. To show the versatility of our techniques, we use our results to give the best known bounds on the number of such vertices and an algorithm to enumerate them. We also improve upon the known lower bounds to show that our results are nearly optimal. One of the main ingredients of our work is a generalization of the famous Hoeffding bound to vector-valued random variables that might be of general interest.


page 1

page 2

page 3

page 4


Sharper bounds for uniformly stable algorithms

The generalization bounds for stable algorithms is a classical question ...

Improved lower bounds for Queen's Domination via an exactly-solvable relaxation

The Queen's Domination problem, studied for over 160 years, poses the fo...

Computing Permanents on a Trellis

The problem of computing the permanent of a matrix has attracted interes...

Various bounds on the minimum number of arcs in a k-dicritical digraph

The dichromatic number χ⃗(G) of a digraph G is the least integer k such ...

An almost optimal bound on the number of intersections of two simple polygons

What is the maximum number of intersections of the boundaries of a simpl...

Counting vertices of integer polytopes defined by facets

We present a number of complexity results concerning the problem of coun...

4-uniform BCT permutations from generalized butterfly structure

As a generalization of Dillon's APN permutation, butterfly structure and...