具有小VC维的均匀集系统
Uniform set systems with small VC-dimension
AI总结:
研究确定(d+1)均匀集系统在VC维至多d时的最大规模问题,提出新的组合方法改进Frankl-Pach上界,消除先前上下界间的主项,并推翻Erdős-Frankl-Pach猜想,提出新猜想。
摘要:
我们研究了确定(d+1)均匀集系统在VC维至多d时的最大规模的长期问题。自Frankl和Pach于1984年建立优雅的上界$\binom{n}{d}$以来,该问题一直难以取得显著进展。已知的下界是$\binom{n-1}{d} + \binom{n-4}{d-2}$,留有显著的间隙$\binom{n-1}{d-1}-\binom{n-4}{d-2}$。尽管数十年的努力,Frankl-Pach界仅有了微小改进:Mubayi和Zhao在素数幂d上引入了$Ω_d(\log{n})$的改进,而Ge、Xu、Yip、Zhang和Zhao在一般d上实现了1的改进。在本工作中,我们提供了一种纯组合方法,显著改进了Frankl-Pach上界。具体而言,对于大n,我们证明Frankl-Pach界可改进为$\binom{n}{d} - \binom{n-1}{d-1} + O_d(n^{d-1 - \frac{1}{4d-2}})=\binom{n-1}{d}+O_d(n^{d-1 - \frac{1}{4d-2}})$。该结果完全消除了先前已知下界和上界间的主项$\binom{n-1}{d-1}$。它还为VC维小的均匀集系统的组合结构提供了新的见解。此外,原始的Erdős-Frankl-Pach猜想,旨在在1980年代推广EKR定理,已被推翻。我们提出一个新的改进猜想,可能在VC维和EKR定理之间建立更稳固的桥梁,并验证了该猜想的几个具体情形,这具有独立兴趣。
英文摘要:
We investigate the longstanding problem of determining the maximum size of a $(d+1)$-uniform set system with VC-dimension at most $d$. Since the seminal 1984 work of Frankl and Pach, which established the elegant upper bound $\binom{n}{d}$, this question has resisted significant progress. The best-known lower bound is $\binom{n-1}{d} + \binom{n-4}{d-2}$, obtained by Ahlswede and Khachatrian, leaving a substantial gap of $\binom{n-1}{d-1}-\binom{n-4}{d-2}$. Despite decades of effort, improvements to the Frankl--Pach bound have been incremental at best: Mubayi and Zhao introduced an $Ω_d(\log{n})$ improvement for prime powers $d$, while Ge, Xu, Yip, Zhang, and Zhao achieved a gain of 1 for general $d$. In this work, we provide a purely combinatorial approach that significantly sharpens the Frankl--Pach upper bound. Specifically, for large $n$, we demonstrate that the Frankl--Pach bound can be improved to $\binom{n}{d} - \binom{n-1}{d-1} + O_d(n^{d-1 - \frac{1}{4d-2}})=\binom{n-1}{d}+O_d(n^{d-1 - \frac{1}{4d-2}})$. This result completely removes the main term $\binom{n-1}{d-1}$ from the previous gap between the known lower and upper bounds. It also offers fresh insights into the combinatorial structure of uniform set systems with small VC-dimension. In addition, the original Erdős--Frankl--Pach conjecture, which sought to generalize the EKR theorem in the 1980s, has been disproven. We propose a new refined conjecture that might establish a sturdier bridge between VC-dimension and the EKR theorem, and we verify several specific cases of this conjecture, which is of independent interest.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。