Convex geometries are extremal for the generalized Sauer-Shelah bound
The electronic journal of combinatorics, Tome 25 (2018) no. 2
The Sauer-Shelah lemma provides an exact upper bound on the size of set families with bounded Vapnik-Chervonekis dimension. When applied to lattices represented as closure systems, this lemma outlines a class of extremal lattices obtaining this bound. Here we show that the Sauer-Shelah bound can be easily generalized to arbitrary antichains, and extremal objects for this generalized bound are exactly convex geometries. We also show that the problem of classification of antichains admitting such extremal objects is NP-complete.
DOI :
10.37236/7217
Classification :
05D05, 52A01, 68Q25
Mots-clés : Sauer-Shelah lemma, convex geometries, extremal lattices
Mots-clés : Sauer-Shelah lemma, convex geometries, extremal lattices
Affiliations des auteurs :
Bogdan Chornomaz  1
@article{10_37236_7217,
author = {Bogdan Chornomaz},
title = {Convex geometries are extremal for the generalized {Sauer-Shelah} bound},
journal = {The electronic journal of combinatorics},
year = {2018},
volume = {25},
number = {2},
doi = {10.37236/7217},
zbl = {1388.05184},
url = {http://geodesic.mathdoc.fr/articles/10.37236/7217/}
}
Bogdan Chornomaz. Convex geometries are extremal for the generalized Sauer-Shelah bound. The electronic journal of combinatorics, Tome 25 (2018) no. 2. doi: 10.37236/7217
Cité par Sources :