REVIEW 1 cited by
Multivalued generalizations of the Frankl--Pach Theorem
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Multivalued generalizations of the Frankl--Pach Theorem
read the original abstract
P. Frankl and J. Pach proved the following uniform version of Sauer's Lemma. Let $n,d,s$ be natural numbers such that $d\leq n$, $s+1\leq n/2$. Let $\cF \subseteq {[n] \choose d}$ 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.
Forward citations
Cited by 1 Pith paper
-
An Optimal Sauer Lemma Over $k$-ary Alphabets
A sharp Sauer inequality for multiclass and list prediction is established in terms of the DS dimension, tight for every alphabet size k, list size ℓ, and dimension value.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.