Frankl-Pach上界对任何均匀性都不是紧的
The Frankl-Pach upper bound is not tight for any uniformity
AI总结:
本文通过多项式方法与结构分析,证明对任意d≥2和n≥2d+2,Frankl-Pach上界$\binom{n}{d}$不是紧的,改进了仅对素数幂d成立的结果。
摘要:
对于任意正整数$n\ge d+1\ge 3$,在$[n]$上VC维数至多为$d$的$(d+1)$-均匀集系统的最大大小是多少?1984年,Frankl和Pach通过优雅的代数证明给出了上界$\binom{n}{d}$。令人惊讶的是,2007年Mubayi和Zhao表明,当$n$足够大且$d$为素数幂时,Frankl-Pach上界不是紧的。他们还指出其方法要求$d$为素数幂,并寻求新想法以在不额外假设$n$和$d$的情况下改进Frankl-Pach上界。本文对任意$d\ge 2$和$n\ge 2d+2$给出了改进,表明长期存在的Frankl-Pach上界$\binom{n}{d}$对任何均匀性都不是紧的。我们的证明结合了简单而强大的多项式方法和结构分析。
英文摘要:
For any positive integers $n\ge d+1\ge 3$, what is the maximum size of a $(d+1)$-uniform set system in $[n]$ with VC-dimension at most $d$? In 1984, Frankl and Pach initiated the study of this fundamental problem and provided an upper bound $\binom{n}{d}$ via an elegant algebraic proof. Surprisingly, in 2007, Mubayi and Zhao showed that when $n$ is sufficiently large and $d$ is a prime power, the Frankl-Pach upper bound is not tight. They also remarked that their method requires $d$ to be a prime power, and asked for new ideas to improve the Frankl-Pach upper bound without extra assumptions on $n$ and $d$. In this paper, we provide an improvement for any $d\ge 2$ and $n\ge 2d+2$, which demonstrates that the long-standing Frankl-Pach upper bound $\binom{n}{d}$ is not tight for any uniformity. Our proof combines a simple yet powerful polynomial method and structural analysis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。