VC dimension and a union theorem for set systems

From MaRDI portal




Abstract: Fix positive integers k and d. We show that, as noinfty, any set system mathcalAsubset2[n] for which the VC dimension of rianglei=1kSimidSiinmathcalA is at most d has size at most . Here riangle denotes the symmetric difference operator. This is a k-fold generalisation of a result of Dvir and Moran, and it settles one of their questions. A key insight is that, by a compression method, the problem is equivalent to an extremal set theoretic problem on k-wise intersection or union that was originally due to ErdH{o}s and Frankl. We also give an example of a family mathcalAsubset2[n] such that the VC dimension of mathcalAcapmathcalA and of mathcalAcupmathcalA are both at most d, while lvertmathcalAvert=Omega(nd). This provides a negative answer to another question of Dvir and Moran.









This page was built for publication: VC dimension and a union theorem for set systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2315444)