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.

Description

[1909.04774] Coding for Sunflowers

Links and resources

URL:
BibTeX key:
rao2019coding
search on:

Comments and Reviews  
(0)

There is no review or comment yet. You can write one!

Tags


Cite this publication