arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2602.17459math.CO
收藏

具有均匀见证的均匀集族

Uniform Set Systems with Uniform Witnesses

Massachusetts Institute of Technology(麻省理工学院)

Ting-Wei Chao, Zixuan Xu, Dmitrii Zakharov

AI总结:

本文研究了均匀集族在VC维约束下的最大规模问题,证明当s≤d/2时猜想成立,且最大构造为星形集族,同时构造了非星形集族的示例,表明问题在不同s值下有显著差异。

摘要:

Frankl--Pach和Erdős猜想任何$(d+1)$-均匀集族$\mathcal{F}\subseteq \binom{[n]}{d+1}$在VC维约束下最大规模为$\binom{n-1}{d}$当$n$足够大。Ahlswede和Khachatrian通过给出大小为$\binom{n-1}{d}+\binom{n-4}{d-2}$的反例证明猜想不成立。对于集族$\mathcal{F}\subseteq \binom{[n]}{d+1}$,其VC维不超过$d$的条件可重新表述为:对于任意$F\in\mathcal{F}$,存在一个子集$B_F\subseteq F$使得$F\cap F'\neq B_F$对所有$F'\in\mathcal{F}$成立。在此方向上,第一作者、许、叶和张猜想若进一步假设每个$F\in \mathcal{F}$的$|B_F|=s$对于某个固定$0\leq s\leq d$,则规模上限为$\binom{n-1}{d}$。当$s=0$时即为Erdős--Ko--Rado定理,$s\in \{1,d\}$的情况在文中由第一作者、许、叶和张证明。在本短 note 中,我们证明当$s\leq d/2$时猜想成立,最大构造为星形集族。此外,我们构造了满足条件的非星形集族,其规模为$\binom{n-1}{d}$,对于$d/2<s\leq d-1$,这表明在这些情况下问题有显著差异。

英文摘要:

Frankl--Pach and Erdős conjectured that any $(d+1)$-uniform set family $\mathcal{F}\subseteq \binom{[n]}{d+1}$ with VC-dimension at most $d$ has size at most $\binom{n-1}{d}$ when $n$ is sufficiently large. Ahlswede and Khachatrian showed that the conjecture is false by giving a counterexample of size $\binom{n-1}{d}+\binom{n-4}{d-2}$. For a set family $\mathcal{F}\subseteq \binom{[n]}{d+1}$, the condition that its VC-dimension is at most $d$ can be reformulated as follows: for any $F\in\mathcal{F}$, there exists a set $B_F\subseteq F$ such that $F\cap F'\neq B_F$ for all $F'\in\mathcal{F}$. In this direction, the first author, Xu, Yip, and Zhang conjectured that the bound $\binom{n-1}{d}$ holds if we further assume that $|B_F|=s$ for every $F\in \mathcal{F}$ and for some fixed $0\leq s\leq d$. The case $s=0$ is exactly the Erdős--Ko--Rado theorem, and the cases $s\in \{1,d\}$ were proved in the paper by the first author, Xu, Yip, and Zhang. In this short note, we show that the conjecture holds when $s\leq d/2$, and the maximal constructions are stars. Moreover, we construct non-star set families of size $\binom{n-1}{d}$ satisfying the condition for $d/2<s\leq d-1$, which suggests that the problem is substantially different in these cases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑