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 be natural numbers such that , . Let be an arbitrary -uniform set system such that does not shatter an -element set, then |cF|leq {n choose s}. We prove here two generalizations of the above theorem to -tuple systems. To obtain these results, we use Gr"obner basis methods, and describe the standard monomials of Hamming spheres.
Recommendations
Cites work
- A combinatorial problem; stability and order for models and theories in infinitary languages
- A forbidden configuration theorem of Alon
- A generalization of Sauer's lemma
- Coordinate density of sets of vectors
- Existence of submatrices with all possible columns
- Gröbner bases for complete uniform families
- scientific article; zbMATH DE number 3712896 (Why is no real title available?)
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 736296 (Why is no real title available?)
- scientific article; zbMATH DE number 3308309 (Why is no real title available?)
- On disjointly representable sets
- On the density of families of sets
- On the density of sets of vectors
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- On the VC-dimension of uniform hypergraphs
- Shattering news
- The lex game and some applications
- Traces of antichains
Cited in
(3)
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)