Multivalued generalizations of the Frankl-Pach theorem

From MaRDI portal



Abstract: P. Frankl and J. Pach proved the following uniform version of Sauer's Lemma. Let n,d,s be natural numbers such that dleqn, s+1leqn/2. Let cFsubseteq[n]choosed be an arbitrary d-uniform set system such that cF does not shatter an s+1-element set, then |cF|leq {n choose s}. We prove here two generalizations of the above theorem to n-tuple systems. To obtain these results, we use Gr"obner basis methods, and describe the standard monomials of Hamming spheres.












This page was built for publication: Multivalued generalizations of the Frankl-Pach theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5389512)