2000 character limit reached
A Sauer-Shelah-Perles Lemma for Sumsets (1806.05737v2)
Published 14 Jun 2018 in math.CO, cs.CG, cs.DM, and cs.LG
Abstract: We show that any family of subsets $A\subseteq 2{[n]}$ satisfies $\lvert A\rvert \leq O\bigl(n{\lceil{d}/{2}\rceil}\bigr)$, where $d$ is the VC dimension of ${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].
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.