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

关于无单纯形簇的集合系统和Junta方法

On set systems without a simplex-cluster and the Junta method

Noam Lifshitz

摘要:

一个$[n]=\{1,2,\ldots,n\}$的$k$ -元素子集的族$\{A_{0},\ldots,A_{d}\}$被称为单纯形簇,如果$A_{0}\cap\cdots\cap A_{d}=\varnothing$,$|A_{0}\cup\cdots\cup A_{d}|\le2k$,以及$\{A_{0},\ldots,A_{d}\}$中集合的任何$d$的交集非空。在2006年,Keevash和Mubayi证明了对于任何$d+1\le k\le\frac{d}{d+1}n$,不包含单纯形簇的$k$ -元素子集的最大族是包含给定元素的所有$k$ -子集的族。证明了对于任意小的$ζ>0$,对所有$k\geζn$的猜想,只要$n\ge n_{0}(ζ,d)$ .如果$A_{0}\cap\cdots\cap A_{d}=\varnothing$和$|A_{0}\cup\cdots\cup A_{d}|\le s$是$[n]$的$k$ -元素子集的族,我们称之为$(d,k,s)$ -簇.我们还表明,对于任何$ζn\le k\le\frac{d}{d+1}n$的$k$ -元素子集的$[n]$,不包含一个$(d,k,(\frac{d+1}{d}+ζ)k)$ -集群的最大的家庭再次是家庭的所有$k$ -子集,包含一个给定的元素,只要$n\ge n_{0}(ζ,d)$。我们的证明是基于军的方法极值组合发起的Dinur和Friedgut和进一步发展的埃利斯,凯勒,和作者。

英文摘要:

A family $\{A_{0},\ldots,A_{d}\}$ of $k$-element subsets of $[n]=\{1,2,\ldots,n\}$ is called a simplex-cluster if $A_{0}\cap\cdots\cap A_{d}=\varnothing$, $|A_{0}\cup\cdots\cup A_{d}|\le2k$, and the intersection of any $d$ of the sets in $\{A_{0},\ldots,A_{d}\}$ is nonempty. In 2006, Keevash and Mubayi conjectured that for any $d+1\le k\le\frac{d}{d+1}n$, the largest family of $k$-element subsets of $[n]$ that does not contain a simplex-cluster is the family of all $k$-subsets that contain a given element. We prove the conjecture for all $k\geζn$ for an arbitrarily small $ζ>0$, provided that $n\ge n_{0}(ζ,d)$. We call a family $\{A_{0},\ldots,A_{d}\}$ of $k$-element subsets of $[n]$ a $(d,k,s)$-cluster if $A_{0}\cap\cdots\cap A_{d}=\varnothing$ and $|A_{0}\cup\cdots\cup A_{d}|\le s$. We also show that for any $ζn\le k\le\frac{d}{d+1}n$ the largest family of $k$-element subsets of $[n]$ that does not contain a $(d,k,(\frac{d+1}{d}+ζ)k)$-cluster is again the family of all $k$-subsets that contain a given element, provided that $n\ge n_{0}(ζ,d)$. Our proof is based on the junta method for extremal combinatorics initiated by Dinur and Friedgut and further developed by Ellis, Keller, and the author.

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

↑