English

Shattering-extremal set systems of small VC-dimension

Combinatorics 2012-11-06 v1

Abstract

We say that a set system F2[n]\mathcal{F}\subseteq 2^{[n]} shatters a given set S[n]S\subseteq [n] if 2S=FS:FF2^S={F \cap S : F \in \mathcal{F}}. The Sauer inequality states that in general, a set system F\mathcal{F} shatters at least F|\mathcal{F}| sets. Here we concentrate on the case of equality. A set system is called shattering-extremal if it shatters exactly F|\mathcal{F}| sets. We characterize shattering extremal set systems of Vapnik-Chervonenkis dimension 1 in terms of their inclusion graphs. Also from the perspective of extremality, we relate set systems of bounded Vapnik-Chervonenkis dimension to their projections.

Keywords

Cite

@article{arxiv.1211.0732,
  title  = {Shattering-extremal set systems of small VC-dimension},
  author = {Tamás Mészáros and Lajos Rónyai},
  journal= {arXiv preprint arXiv:1211.0732},
  year   = {2012}
}

Comments

17 pages