New Helly-type results for discrete boxes: Quantitative colorful and (p,q)-variants

Abstract

In 2008, Halman showed that for any finite set P⊂ Rd and any finite family B of axis-parallel boxes in Rd, if the intersection of P and any subfamily B' ⊂eqB of size at most 2d is non-empty, then the intersection of P and B is also non-empty. Very recently Edwards and Sober\'on initiated the study of quantitative colorful version for 2d families, (p,q)-type variation for p≥ q≥ d+1, and other extensions of this Helly-type result by Halman. In this paper, we study the quantitative colorful Halman problem for 2d-1 families as well its (p,q)-type variation for p≥ q≥ 2. Specifically, our main result asserts that for any finite set P and finite families of boxes B1,…,B2d-1 in Rd, where d≥ 2, if every transversal B for the families has an intersection B containing at least n points of P, then there exist j∈[2d-1] and a subset of P of size at most \[ 2n+ n-1d · 2d-1 , \] such that each box of Bj contains at least n points of this subset.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…