A Sauer-Shelah-Perles lemma for sumsets

zbMath1400.05250arXiv1806.05737MaRDI QIDQ1627216

Zeev Dvir, Shay Moran

Publication date: 22 November 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.05737

zbMATH Keywords

VC dimensionextremal combinatoricspolynomial method

Mathematics Subject Classification ID

Algebraic combinatorics (05E99) Extremal set theory (05D05)

Related Items (2)

A uniform version of a theorem by Dvir and Moran ⋮ VC dimension and a union theorem for set systems

Cites Work

• Unnamed Item
• Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• Well-known bound for the VC-dimension made easy
• The sum of nonsingular matrices is often nonsingular
• A combinatorial problem; stability and order for models and theories in infinitary languages
• On the density of families of sets
• Sárközy's Theorem in Function Fields
• Learnability and the Vapnik-Chervonenkis dimension
• A tight bound for Green's arithmetic triangle removal lemma in vector spaces
• Shattered Sets and the Hilbert Function

This page was built for publication: A Sauer-Shelah-Perles lemma for sumsets