Table of Contents
Fetching ...

The Quantitative Fractional Helly theorem

Nóra Frankl, Attila Jung, István Tomon

TL;DR

The paper advances quantitative extensions of Helly-type theorems by uniting the Fractional Helly framework with the Quantitative Volume theorem. It establishes a sharp (d+1)-tuple quantitative Helly result and leverages it to obtain a quantitative $(p,d+1)$-theorem and its diameter analogue, supported by a robust transversality framework based on quantitative fractional transversals and weak epsilon nets. The authors also prove a QFH result for $(2d)$-tuples and derive a quantitative $(p,q)$-theorem, with diameter-variant counterparts, using hypergraph Ramsey and supersaturation methods alongside ellipsoid approximations. Collectively, the work sharpens our understanding of how fractional intersection patterns enforce positive-volume intersections and finite transversal structures in convex geometry.

Abstract

Two celebrated extensions of Helly's theorem are the Fractional Helly theorem of Katchalski and Liu (1979) and the Quantitative Volume theorem of Bárány, Katchalski, and Pach (1982). Improving on several recent works, we prove an optimal combination of these two results. We show that given a family $\mathcal{F}$ of $n$ convex sets in $\mathbb{R}^d$ such that at least $α\binom{n}{d+1}$ of the $(d+1)$-tuples of $\mathcal{F}$ have an intersection of volume at least 1, then one can select $Ω_{d,α}(n)$ members of $\mathcal{F}$ whose intersection has volume at least $Ω_d(1)$. Furthermore, with the help of this theorem, we establish a quantitative version of the $(p,q)$ theorem of Alon and Kleitman. Let $p\geq q\geq d+1$ and let $\mathcal{F}$ be a finite family of convex sets in $\mathbb{R}^d$ such that among any $p$ elements of $\mathcal{F}$, there are $q$ that have an intersection of volume at least $1$. Then, we prove that there exists a family $T$ of $O_{p,q}(1)$ ellipsoids of volume $Ω_d(1)$ such that every member of $\mathcal{F}$ contains at least one element of $T$. Finally, we present extensions about the diameter version of the Quantitative Helly theoerm.

The Quantitative Fractional Helly theorem

TL;DR

The paper advances quantitative extensions of Helly-type theorems by uniting the Fractional Helly framework with the Quantitative Volume theorem. It establishes a sharp (d+1)-tuple quantitative Helly result and leverages it to obtain a quantitative -theorem and its diameter analogue, supported by a robust transversality framework based on quantitative fractional transversals and weak epsilon nets. The authors also prove a QFH result for -tuples and derive a quantitative -theorem, with diameter-variant counterparts, using hypergraph Ramsey and supersaturation methods alongside ellipsoid approximations. Collectively, the work sharpens our understanding of how fractional intersection patterns enforce positive-volume intersections and finite transversal structures in convex geometry.

Abstract

Two celebrated extensions of Helly's theorem are the Fractional Helly theorem of Katchalski and Liu (1979) and the Quantitative Volume theorem of Bárány, Katchalski, and Pach (1982). Improving on several recent works, we prove an optimal combination of these two results. We show that given a family of convex sets in such that at least of the -tuples of have an intersection of volume at least 1, then one can select members of whose intersection has volume at least . Furthermore, with the help of this theorem, we establish a quantitative version of the theorem of Alon and Kleitman. Let and let be a finite family of convex sets in such that among any elements of , there are that have an intersection of volume at least . Then, we prove that there exists a family of ellipsoids of volume such that every member of contains at least one element of . Finally, we present extensions about the diameter version of the Quantitative Helly theoerm.
Paper Structure (8 sections, 17 theorems, 8 equations)

This paper contains 8 sections, 17 theorems, 8 equations.

Key Result

Theorem 1.1

For every positive integer $d$, there exists $c_0=c_0(d)>0$ such that the following holds. Let $\mathcal{F}$ be a family of $n$ convex sets in $\mathbb{R}^d$ such that at least $\alpha \binom{n}{2d}$ of the $(2d)$-tuples of members of $\mathcal{F}$ have an intersection of volume at least $1$. Then t

Theorems & Definitions (27)

  • Theorem 1.1
  • Theorem 1.2
  • Theorem 1.3: Quantitative $(p,d+1)$ theorem
  • Theorem 1.4
  • Theorem 1.5
  • Lemma 2.1: Colorful Helly theorem
  • Lemma 2.2: Quantitative Helly theorem
  • Lemma 2.3: Galicer, Merzbacher, and Pinasco GMP
  • Lemma 2.4
  • Lemma 2.5
  • ...and 17 more