English

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 A2[n]A\subseteq 2^{[n]} satisfies AO(nd/2)\lvert A\rvert \leq O\bigl(n^{\lceil{d}/{2}\rceil}\bigr), where dd is the VC dimension of {STS,TA}\{S\triangle T \,\vert\, S,T\in A\}, and \triangle is the symmetric difference operator. We also observe that replacing \triangle by either \cup or \cap 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