On the convexified Sauer-Shelah theorem (Q1354724): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jctb.1996.1736 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2082435672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Remark on the Szarek–Talagrand Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proportional Dvoretzky-Rogers factorization result / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083487 / 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: Q3828516 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:29, 27 May 2024

scientific article
Language Label Description Also known as
English
On the convexified Sauer-Shelah theorem
scientific article

    Statements

    On the convexified Sauer-Shelah theorem (English)
    0 references
    0 references
    0 references
    3 June 1997
    0 references
    Let \(A\) be a subset of \(\{0,1\}^n\). Given \(\varepsilon>0\), we can find a subset \(I\) of \(\{1,\dots,n\}\) such that the convex hull in \(\mathbb{R}^I\) of the projection of \(A\) onto \(\{0,1\}^I\) contains the cube \([1/2-\varepsilon,1/2+\varepsilon]^I\), and that \(\text{card }I\geq n-K(n\varepsilon+\sqrt{n\log(2^n/\text{card }A)})\), where \(K>0\) is a universal constant.
    0 references
    Sauer-Shelah theorem
    0 references
    combinatorial complexity
    0 references

    Identifiers