Sauer–Shelah lemma
In combinatorial mathematics and extremal set theory, the Sauer–Shelah lemma states that every family of sets with small VC dimension consists of a small number of sets. It is named after and Saharon Shelah, who published it independently of each other in 1972. The same result was also published slightly earlier and again independently, by Vladimir Vapnik and Alexey Chervonenkis, after whom the VC dimension is named. In his paper containing the lemma, Shelah gives credit also to Micha Perles, and for this reason the lemma has also been called the Perles–Sauer–Shelah lemma.
known for
Wikipage redirect
Culture of IsraelExtremal Problems For Finite SetsExtremal combinatoricsGrowth functionList of Israeli inventions and discoveriesMicha PerlesPerles-Sauer-Shelah lemmaPerles–Sauer–Shelah lemmaSaharon ShelahSauer-Shelah lemmaShattered setUniform convergence in probabilityVapnik–Chervonenkis dimensionVapnik–Chervonenkis theory
Link from a Wikipage to another Wikipage
known for
primaryTopic
Sauer–Shelah lemma
In combinatorial mathematics and extremal set theory, the Sauer–Shelah lemma states that every family of sets with small VC dimension consists of a small number of sets. It is named after and Saharon Shelah, who published it independently of each other in 1972. The same result was also published slightly earlier and again independently, by Vladimir Vapnik and Alexey Chervonenkis, after whom the VC dimension is named. In his paper containing the lemma, Shelah gives credit also to Micha Perles, and for this reason the lemma has also been called the Perles–Sauer–Shelah lemma.
has abstract
In combinatorial mathematics a ...... ete geometry and graph theory.
@en
Wikipage page ID
33,074,892
page length (characters) of wiki page
Wikipage revision ID
1,021,563,762
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
comment
In combinatorial mathematics a ...... the Perles–Sauer–Shelah lemma.
@en
label
Sauer–Shelah lemma
@en