arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.03015math.CO
收藏

关于交影定理的加强

On strengthenings of the intersecting shadow theorem

P. Frankl, G. O. H. Katona

摘要:

令$n > k > t \geq j \geq 1$为整数。设$X$是$n$元素集,${X\choose k}$是其$k$子集的集合.一个家族$\mathcal F \subset {X\choose k}$称为$t$ -如果所有$F, F' \in \mathcal F$的$|F \cap F'| \geq t$相交。$j$ 'th shadow $\partial^j \mathcal F$是包含在~ $\mathcal F$的某个成员中的所有$(k - j)$ -子集的集合。将$|\partial^j \mathcal F|$估计为$|\mathcal F|$的函数是极值集理论中广泛使用的工具。第二作者的一个经典结果(定理\ref{th:1.3})为$t$ -相交族提供了这样一个界.最好是$|\mathcal F| = {2k - t\choose k}$。我们的主要结果是定理\ref{th:1.4},它给出了一个渐近最佳界上的$|\partial^j \mathcal F| / |\mathcal F|$的$|\mathcal F|$稍大,例如,$|\mathcal F| > \frac32 {2k - t\choose k}$。我们还为$|\mathcal F|$提供了进一步的改进。

英文摘要:

Let $n > k > t \geq j \geq 1$ be integers. Let $X$ be an $n$-element set, ${X\choose k}$ the collection of its $k$-subsets. A family $\mathcal F \subset {X\choose k}$ is called $t$-intersecting if $|F \cap F'| \geq t$ for all $F, F' \in \mathcal F$. The $j$'th shadow $\partial^j \mathcal F$ is the collection of all $(k - j)$-subsets that are contained in some member of~$\mathcal F$. Estimating $|\partial^j \mathcal F|$ as a function of $|\mathcal F|$ is a widely used tool in extremal set theory. A classical result of the second author (Theorem \ref{th:1.3}) provides such a bound for $t$-intersecting families. It is best possible for $|\mathcal F| = {2k - t\choose k}$. Our main result is Theorem \ref{th:1.4} which gives an asymptotically optimal bound on $|\partial^j \mathcal F| / |\mathcal F|$ for $|\mathcal F|$ slightly larger, e.g., $|\mathcal F| > \frac32 {2k - t\choose k}$. We provide further improvements for $|\mathcal F|$ very large as well.

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

↑