A Sauer-Shelah-Perles Lemma for Sumsets
Combinatorics
2018-06-21 v2 Computational Geometry
Discrete Mathematics
Machine Learning
Abstract
We show that any family of subsets satisfies , where is the VC dimension of , and is the symmetric difference operator. We also observe that replacing by either or fails to satisfy an analogous statement. Our proof is based on the polynomial method; specifically, on an argument due to [Croot, Lev, Pach '17].
Keywords
Cite
@article{arxiv.1806.05737,
title = {A Sauer-Shelah-Perles Lemma for Sumsets},
author = {Zeev Dvir and Shay Moran},
journal= {arXiv preprint arXiv:1806.05737},
year = {2018}
}
Comments
6 pages, fixed a few typos