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

Ahlswede-Khachatrian定理在交叉t-交族中的推广

Towards extending the Ahlswede-Khachatrian theorem to cross t-intersecting families

Sang June Lee, Mark Siggers, Norihide Tokushige

摘要:

Ahlswede和Khachatrian的直径定理是他们的完全相交定理的加权版本,其本身是$t$-相交Erdens-Ko-Rado定理的扩展。他们的相交定理说,$[n] = \{1, \dots, n\}$的子集族的最大尺寸,其中每对至少在$t$元素中相交,是Frankl提出的某些平凡相交族的尺寸。我们解决一个交叉交叉版本的直径定理。如果对于每个$A \in \mathcal{A}$和$B \in \mathcal{B}$,$A$和$B$至少在$t$元素中相交,则$[n]$的子集的两个族$\mathcal{A}$和$\mathcal{B}$是{\em交叉$t$-相交}。$[n]$的$k$元素子集$A$的$p$-权重是$p^{k}(1-p)^{n-k}$,并且族$\mathcal{A}$的权重是其集合的权重之和。一对族的权重是这两个族的权重的乘积。$t$相交族的最大$p$权重取决于$p$的值. Ahlswede和Khachatrian表明,对于范围为$[\frac{r}{t + 2r - 1}, \frac{r+1}{t + 2r + 1}]$的$p$,$t$交叉族的最大$p$-权是由至少包含集合$[t+2r]$的$t+r$元素的$[n]$的所有子集组成的家族$\mathcal{F}^t_r$的权.在以前的论文中,我们展示了一个交叉$t$-交叉版本的大$t$的情况下,$r = 0$。在本文中,我们做了同样的情况下,$r = 1$。我们表明,$p$在范围$[\frac{1}{t + 1}, \frac{2}{t + 3}]$的最大$p$-重量的交叉$t$交叉对家庭,$t \geq 200$,实现时,两个家庭都是$\mathcal{F}^t_1$。此外,我们表明,除了在这个范围的端点,这是同构,唯一的一对$t$交叉家庭实现这个重量。

英文摘要:

Ahlswede and Khachatrian's diametric theorem is a weighted version of their complete intersection theorem, itself an extension of the $t$-intersecting Erdős-Ko-Rado theorem. Their intersection theorem says that the maximum size of a family of subsets of $[n] = \{1, \dots, n\}$, every pair of which intersects in at least $t$ elements, is the size of certain trivially intersecting families proposed by Frankl. We address a cross intersecting version of their diametric theorem. Two families $\mathcal{A}$ and $\mathcal{B}$ of subsets of $[n]$ are {\em cross $t$-intersecting} if for every $A \in \mathcal{A}$ and $B \in \mathcal{B}$, $A$ and $B$ intersect in at least $t$ elements. The $p$-weight of a $k$ element subset $A$ of $[n]$ is $p^{k}(1-p)^{n-k}$, and the weight of a family $\mathcal{A}$ is the sum of the weights of its sets. The weight of a pair of families is the product of the weights of the families. The maximum $p$-weight of a $t$-intersecting family depends on the value of $p$. Ahlswede and Khachatrian showed that for $p$ in the range $[\frac{r}{t + 2r - 1}, \frac{r+1}{t + 2r + 1}]$, the maximum $p$-weight of a $t$-intersecting family is that of the family $\mathcal{F}^t_r$ consisting of all subsets of $[n]$ containing at least $t+r$ elements of the set $[t+2r]$. In a previous paper we showed a cross $t$-intersecting version of this for large $t$ in the case that $r = 0$. In this paper, we do the same in the case that $r = 1$. We show that for $p$ in the range $[\frac{1}{t + 1}, \frac{2}{t + 3}]$ the maximum $p$-weight of a cross $t$-intersecting pair of families, for $t \geq 200$, is achieved when both families are $\mathcal{F}^t_1$. Further, we show that except at the endpoints of this range, this is, up to isomorphism, the only pair of $t$-intersecting families achieving this weight.

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

↑