Shattering-extremal set systems of VC dimension at most 2

preprint2014arXivOpen access

Abstract

We say that a set system F⊆2[n]\mathcal{F}\subseteq 2^{[n]} shatters a given set S⊆[n]S\subseteq [n] if 2S={F∩S:F∈F}2^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. In this paper we characterize shattering-extremal set systems of Vapnik-Chervonenkis dimension 22 in terms of their inclusion graphs, and as a corollary we answer an open question from \cite{VC1} about leaving out elements from shattering-extremal set systems in the case of families of Vapnik-Chervonenkis dimension 22.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.