%0 Journal Article %1 rao2019coding %A Rao, Anup %D 2019 %K bounds mathematics proof-systems theory %T Coding for Sunflowers %U http://arxiv.org/abs/1909.04774 %X 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.

@article{rao2019coding, 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 $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.}, added-at = {2019-09-12T16:40:07.000+0200}, author = {Rao, Anup}, biburl = {https://www.bibsonomy.org/bibtex/2e538524fe6a90fba76a940b233476976/kirk86}, description = {[1909.04774] Coding for Sunflowers}, interhash = {ee66d0963cc2f702bb9d48dc18b4ef27}, intrahash = {e538524fe6a90fba76a940b233476976}, keywords = {bounds mathematics proof-systems theory}, note = {cite arxiv:1909.04774}, timestamp = {2019-09-12T16:40:26.000+0200}, title = {Coding for Sunflowers}, url = {http://arxiv.org/abs/1909.04774}, year = 2019 }