A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
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 suchdoi:10.37236/7217 fatcat:hrpymp3l3jgn3lcsyfrko42g6q