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

关于对称交族

On symmetric intersecting families

David Ellis, Gil Kalai, Bhargav Narayanan

摘要:

我们取得了一些进展的问题,从20世纪70年代的Babai,即:对于$n, k \in \mathbb{N}$与$k \le n/2$,什么是最大可能的基数$s(n,k)$交叉家庭的$k$ -元素子集的$\{1,2,\ldots,n\}$承认一个传递群的自同构?我们给出了$s(n,k)$的上界和下界,并特别表明,$s(n,k) = o (\binom{n-1}{k-1})$作为$n \to \infty$当且仅当$k = n/2 - ω(n)(n/\log n)$为一些功能$ω(\cdot)$,增加没有限制,从而确定的阈值在“对称”相交家庭是微不足道的小相比,最大尺寸的相交家庭。我们还展示了群论和加性数论中的一些基本问题的联系,并提出了一些问题。

英文摘要:

We make some progress on a question of Babai from the 1970s, namely: for $n, k \in \mathbb{N}$ with $k \le n/2$, what is the largest possible cardinality $s(n,k)$ of an intersecting family of $k$-element subsets of $\{1,2,\ldots,n\}$ admitting a transitive group of automorphisms? We give upper and lower bounds for $s(n,k)$, and show in particular that $s(n,k) = o (\binom{n-1}{k-1})$ as $n \to \infty$ if and only if $k = n/2 - ω(n)(n/\log n)$ for some function $ω(\cdot)$ that increases without bound, thereby determining the threshold at which `symmetric' intersecting families are negligibly small compared to the maximum-sized intersecting families. We also exhibit connections to some basic questions in group theory and additive number theory, and pose a number of problems.

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

↑