Coding for Sunflowers
Combinatorics
2020-02-27 v2 Computational Complexity
Discrete Mathematics
Information Theory
math.IT
Abstract
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 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.
Cite
@article{arxiv.1909.04774,
title = {Coding for Sunflowers},
author = {Anup Rao},
journal= {arXiv preprint arXiv:1909.04774},
year = {2020}
}
Comments
Revised version includes an improved bound. This version is published by Discrete Analysis