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

奇-向日葵

Odd-Sunflowers

Peter Frankl, János Pach, Dömötör Pálvölgyi

AI总结:

本文推广了sunflowers的概念定义了odd-sunflower,基于已证明的Erdős--Szemerédi猜想给出了不含odd-sunflower子集族的上界常数μ<2,并构造了大小至少为1.5021^n的此类族,同时刻画了三元组的最小odd-sunflower。

摘要:

推广sunflowers的概念,我们将至少两个集合的族称为odd-sunflower,如果基础集的每个元素要么包含在奇数个集合中,要么不包含在任何集合中。根据最近被Naslund和Sawin证明的Erdős--Szemerédi猜想,存在常数μ<2,使得n元素集的任何不包含odd-sunflower的子集族最多由μ^n个集合组成。我们构造了大小至少为1.5021^n的此类族。我们还刻画了三元组的最小odd-sunflower。

英文摘要:

Extending the notion of sunflowers, we call a family of at least two sets an odd-sunflower if every element of the underlying set is contained in an odd number of sets or in none of them. It follows from the Erd\H os--Szemerédi conjecture, recently proved by Naslund and Sawin, that there is a constant $μ<2$ such that every family of subsets of an $n$-element set that contains no odd-sunflower consists of at most $μ^n$ sets. We construct such families of size at least $1.5021^n$. We also characterize minimal odd-sunflowers of triples.

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

↑