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

关于向日葵

About sunflowers

Gábor Hegedűs

摘要:

Alon,Shpilka和Umans考虑了以下版本的通常的向日葵自由子集:一个子集$\mbox{$ \cal F $}\subseteq \{1,\ldots ,D\}^n$为$D>2$是向日葵自由的,如果对于每个不同的三元组$x,y,z\in \mbox{$ \cal F $}$存在一个坐标$i$,其中正好两个$x_i,y_i,z_i$是相等的。Naslund和Sawin将多项式方法与特征理论相结合,证明了任意向日葵自由集$\mbox{$ \cal F $}\subseteq \{1,\ldots ,D\}^n$都有大小$$ |\mbox{$\cal F$}|\leq c_D^n, $$,其中$c_D=\frac{3}{2^{2/3}}(D-1)^{2/3}$ .本文给出了$\{1,\ldots ,D\}^n$的无向日葵子集的大小的一个新的上界。我们的主要结果是一个新的上限的向日葵免费$k$ -均匀子集的大小。更准确地说,让$k$是一个任意整数。设$\mbox{$ \cal F $}$是一个无向日葵的$k$ -均匀集系统。考虑$M:=|\bigcup\limits_{F\in \mbox{$ \cal F $}} F|. $然后$$ |\mbox{$\cal F$}|\leq 3(\lceil\frac{2k}{3}\rceil+1)(2^{1/3}\cdot 3e)^k(\lceil\frac Mk\rceil -1)^{\lceil\frac{2k}{3}\rceil}. $$在证明中,我们使用Naslund和Sawin关于$\{1,\ldots ,D\}^n$中的无向日葵子集的结果。

英文摘要:

Alon, Shpilka and Umans considered the following version of usual sunflower-free subset: a subset $\mbox{$\cal F$}\subseteq \{1,\ldots ,D\}^n$ for $D>2$ is sunflower-free if for every distinct triple $x,y,z\in \mbox{$\cal F$}$ there exists a coordinate $i$ where exactly two of $x_i,y_i,z_i$ are equal. Combining the polynomial method with character theory Naslund and Sawin proved that any sunflower-free set $\mbox{$\cal F$}\subseteq \{1,\ldots ,D\}^n$ has size $$ |\mbox{$\cal F$}|\leq c_D^n, $$ where $c_D=\frac{3}{2^{2/3}}(D-1)^{2/3}$. In this short note we give a new upper bound for the size of sunflower-free subsets of $\{1,\ldots ,D\}^n$. Our main result is a new upper bound for the size of sunflower-free $k$-uniform subsets. More precisely, let $k$ be an arbitrary integer. Let $\mbox{$\cal F$}$ be a sunflower-free $k$-uniform set system. Consider $M:=|\bigcup\limits_{F\in \mbox{$\cal F$}} F|. $ Then $$ |\mbox{$\cal F$}|\leq 3(\lceil\frac{2k}{3}\rceil+1)(2^{1/3}\cdot 3e)^k(\lceil\frac Mk\rceil -1)^{\lceil\frac{2k}{3}\rceil}. $$ In the proof we use Naslund and Sawin's result about sunflower-free subsets in $\{1,\ldots ,D\}^n$.

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

↑