A Sauer-Shelah-Perles lemma for sumsets (Q1627216): Difference between revisions

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

Revision as of 10:49, 17 July 2024

scientific article
Language Label Description Also known as
English
A Sauer-Shelah-Perles lemma for sumsets
scientific article

    Statements

    A Sauer-Shelah-Perles lemma for sumsets (English)
    0 references
    0 references
    0 references
    22 November 2018
    0 references
    Summary: We show that any family of subsets \(A\subseteq 2^{[n]}\) satisfies \(|A|\leq O(n^{\lceil{d}/{2}\rceil})\), where \(d\) is the VC dimension of \(\{S\triangle T \,|\, 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 [\textit{E. Croot} et al., Ann. Math. (2) 185, No. 1, 331--337 (2017; Zbl 1425.11019)].
    0 references
    extremal combinatorics
    0 references
    VC dimension
    0 references
    polynomial method
    0 references

    Identifiers