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

不含弱Delta-系统族的上界

Upper Bounds For Families Without Weak Delta-Systems

Eric Naslund

摘要:

对于$k\geq3$,如果来自集合的任何两个集合的交集具有相同的大小,则称$k$集合的集合形成\emph{weak $Δ$-system}。Erdés和Szemerédi询问了不包含弱$Δ$系统的$\{1,\dots,n\}$子集的最大家族$\mathcal{F}$的大小。本文改进了作者和Sawin在arXiv:1606.09575中的最佳上界,证明了\[ |\mathcal{F}|\leq\left(\frac{2}{3}Θ(C)+o(1)\right)^{n} \],其中$Θ(C)$是capset容量.特别地,这表明\[ |\mathcal{F}|\leq(1.8367\dots+o(1))^{n}. \]

英文摘要:

For $k\geq3$, a collection of $k$ sets is said to form a \emph{weak $Δ$-system} if the intersection of any two sets from the collection has the same size. Erdős and Szemerédi asked about the size of the largest family $\mathcal{F}$ of subsets of $\{1,\dots,n\}$ that does not contain a weak $Δ$-system. In this note we improve upon the best upper bound of the author and Sawin from arXiv:1606.09575 and show that \[ |\mathcal{F}|\leq\left(\frac{2}{3}Θ(C)+o(1)\right)^{n} \] where $Θ(C)$ is the capset capacity. In particular, this shows that \[ |\mathcal{F}|\leq(1.8367\dots+o(1))^{n}. \]

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

↑