Largest dyadic dual VC-dimension of non-piercing families
Xinqi Huang, Yuzhen Qi, Mingyuan Rong, Zixiang Xu

TL;DR
This paper determines that the maximum dyadic dual VC-dimension of non-piercing families is exactly 4, and applies this to improve bounds on the transversal number relative to the matching number.
Contribution
It precisely establishes the maximum dyadic dual VC-dimension for non-piercing families as 4, and provides a simplified proof relating transversal and matching numbers.
Findings
Maximum dyadic dual VC-dimension of non-piercing families is 4
Transversal number is at most C times the ninth power of the matching number
Improves previous bounds on transversal numbers for geometric set families
Abstract
The dyadic dual VC-dimension of a set system \( \mathcal{F} \) is the largest integer \( \ell \) such that there exist \( \ell \) sets \( F_1, F_{2}, \dots, F_\ell \in \mathcal{F} \), where every pair \( \{i, j\} \in \binom{[\ell]}{2} \) is witnessed by an element \( a_{i,j} \in F_i \cap F_j \) that does not belong to any other set \( F_k \) with \( k \in [\ell] \setminus \{i, j\} \). In this paper, we determine the largest dyadic dual VC-dimension of a non-piercing family is exactly , providing a rare example where the maximum of this parameter can be determined for a natural family arising from geometry. As an application, we give a short and direct proof that the transversal number \( \tau(\mathcal{F}) \) of any non-piercing family is at most \(C\nu(\mathcal{F})^9 \), where \( \nu(\mathcal{F}) \) is the matching number and is a constant. This improves a recent result of…
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.
Taxonomy
TopicsSexuality, Behavior, and Technology
