Coding for Sunflowers

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.

Revised version includes an improved bound. This version is published by Discrete Analysis

References in corpus (1)

• Improved bounds for the sunflower lemma

Cited by in corpus (1)

• Monotone Circuit Lower Bounds from Robust Sunflowers