Bounded VC-Dimension Implies a Fractional Helly Theorem

被引:0
|
作者
Jirí Matousek
机构
[1] Department of Applied Mathematics and Institute of Theoretical Computer Science (ITI),
[2] Charles University,undefined
[3] Malostranské nám. 25,undefined
[4] 11800 Praha 1,undefined
来源
关键词
Bounded Number; Bounded Degree; Polynomial Inequality; Helly Property; Helly Number;
D O I
暂无
中图分类号
学科分类号
摘要
We prove that every set system of bounded VC-dimension has a fractional Helly property. More precisely, if the dual shatter function of a set system $\FF$ is bounded by $o(m^k)$, then $\FF$ has fractional Helly number $k$. This means that for every $\alpha>0$ there exists a $\beta>0$ such that if $F_1,F_2,\ldots,F_n\in\FF$ are sets with $\bigcap_{i\in I}F_i\neq\emptyset$ for at least $\alpha{n\choose k}$ sets $I\subseteq\{1,2,\ldots,n\}$ of size $k$, then there exists a point common to at least $\beta n$ of the $F_i$. This further implies a $(p,k)$-theorem: for every $\FF$ as above and every $p\geq k$ there exists $T$ such that if $\GG\subseteq\FF$ is a finite subfamily where among every $p$ sets, some $k$ intersect, then $\GG$ has a transversal of size $T$. The assumption about bounded dual shatter function applies, for example, to families of sets in $\Rd$ definable by a bounded number of polynomial inequalities of bounded degree; in this case we obtain fractional Helly number $d{+}1$.
引用
收藏
页码:251 / 255
页数:4
相关论文
共 50 条
  • [41] ON THE PRACTICAL APPLICABILITY OF VC-DIMENSION BOUNDS
    HOLDEN, SB
    NIRANJAN, M
    NEURAL COMPUTATION, 1995, 7 (06) : 1265 - 1288
  • [42] VC-Dimension and Shortest Path Algorithms
    Abraham, Ittai
    Delling, Daniel
    Fiat, Amos
    Goldberg, Andrew V.
    Werneck, Renato F.
    AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT I, 2011, 6755 : 690 - 699
  • [43] Recursive Teaching Dimension, VC-Dimension and Sample Compression
    Doliwa, Thorsten
    Fan, Gaojian
    Simon, Hans Ulrich
    Zilles, Sandra
    JOURNAL OF MACHINE LEARNING RESEARCH, 2014, 15 : 3107 - 3131
  • [44] On ordinal VC-dimension and some notions of complexity
    Martin, E
    Sharma, A
    Stephan, F
    ALGORITHMIC LEARNING THEORY, PROCEEDINGS, 2003, 2842 : 54 - 68
  • [45] A fractional Helly theorem for boxes
    Barany, I.
    Fodor, F.
    Martinez-Perez, A.
    Montejano, L.
    Oliveros, D.
    Por, A.
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2015, 48 (03): : 221 - 224
  • [46] Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension
    Ducoffe, Guillaume
    Habib, Michel
    Viennot, Laurent
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1905 - 1922
  • [47] VC-dimension of a context-dependent Perceptron
    Ciskowski, P
    MODELING AND USING CONTEXT, PROCEEDINGS, 2001, 2116 : 429 - 432
  • [48] On the VC-dimension and boolean functions with long runs
    Ratsaby, Joel
    JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY, 2007, 10 (02): : 205 - 225
  • [49] The VC-Dimension of Visibility on the Boundary of a Simple Polygon
    Gibson, Matt
    Krohn, Erik
    Wang, Qing
    ALGORITHMS AND COMPUTATION, ISAAC 2015, 2015, 9472 : 541 - 551
  • [50] Minimum Polygons for Fixed Visibility VC-Dimension
    Beck, Moritz
    Storandt, Sabine
    COMBINATORIAL ALGORITHMS, IWOCA 2018, 2018, 10979 : 65 - 77