Optimal multivalued shattering
From MaRDI portal
Abstract: We have found the most general extension of the celebrated Sauer, Perles and Shelah, Vapnik and Chervonenkis result from 0-1 sequences to -ary codes still giving a polynomial bound. Let be a -ary code of length . For a subset of coordinates the projection of to is denoted by . We say that -{em shatters} if contains all the distinct vectors (codewords) with coordinates and . Suppose that does not -shatter any coordinate set of size for every and let . Using a natural induction we prove that |{mathcal C}|leq O(n^p) for any given as and give a construction showing that this exponent is the best possible. Several open problems are mentioned.
Recommendations
Cited in
(6)- Multi-symbol forbidden configurations
- Embeddings and the trace of finite sets
- Shattering All Sets of ‘k’ Points in “General Position” Requires (k — 1)/2 Parameters
- Exponential multivalued forbidden configurations
- Shatter functions with polynomial growth rates
- Multivalued matrices and forbidden configurations
This page was built for publication: Optimal multivalued shattering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910947)