Discrete quantitative Helly-type theorems with boxes
Travis Dillon

TL;DR
This paper introduces new quantitative Helly-type theorems for integer lattices using axis-parallel boxes, showing bounded Helly numbers in fixed dimensions and exploring variants and counterexamples.
Contribution
It combines volumetric and combinatorial approaches to establish bounded Helly numbers with boxes as witness sets and extends the theory with colorful, fractional, and counterexample results.
Findings
Helly numbers for integer lattices grow polynomially in fixed dimensions.
Helly numbers with boxes as witness sets are uniformly bounded.
Counterexamples show Helly numbers can be infinite for certain sets.
Abstract
Research on Helly-type theorems in combinatorial convex geometry has produced volumetric versions of Helly's theorem using witness sets and quantitative extensions of Doignon's theorem. This paper combines these philosophies and presents quantitative Helly-type theorems for the integer lattice with axis-parallel boxes as witness sets. Our main result shows that, while quantitative Helly numbers for the integer lattice grow polynomially in each fixed dimension, their variants with boxes as witness sets are uniformly bounded. We prove several colorful and fractional variations on this theorem. We also prove that the Helly number for need not be finite even when is a syndetic set.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
