向日葵的编码
Coding for Sunflowers
摘要：
向日葵是具有相同的两两相交的集合族。我们简化了最近的结果Alweiss，洛维特，吴和张，给出了一个上界的大小的每一个家庭的集合的大小$k$，不包含向日葵。我们将展示如何使用香农的无噪声编码定理的逆给一个干净的证明他们的结果。
英文摘要：
A sunflower is a family of sets that have the same pairwise intersections. We simplify a recent result of Alweiss, Lovett, Wu and Zhang that gives an upper bound on the size of every family of sets of size $k$ that does not contain a sunflower. We show how to use the converse of Shannon's noiseless coding theorem to give a cleaner proof of their result.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
