Coding for Sunflowers

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.

[1]  Shachar Lovett,et al.  From DNF compression to sunflower theorems via regularity , 2019, Electron. Colloquium Comput. Complex..

[2]  H. L. Abbott,et al.  Intersection Theorems for Systems of Sets , 1972, J. Comb. Theory, Ser. A.

[3]  Shachar Lovett,et al.  DNF sparsification beyond sunflowers , 2018, Electron. Colloquium Comput. Complex..

[4]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[5]  Paul Erdös,et al.  Arithmetic progressions in subset sums , 1992, Discret. Math..

[6]  Jeff Kahn,et al.  Thresholds versus fractional expectation-thresholds , 2019, ArXiv.

[7]  Anna Gál,et al.  The cell probe complexity of succinct data structures , 2007, Theor. Comput. Sci..

[8]  Anup Rao,et al.  Lower Bounds on Non-Adaptive Data Structures Maintaining Sets of Numbers, from Sunflowers , 2018, Computational Complexity Conference.

[9]  Omer Reingold,et al.  DNF sparsification and a faster deterministic counting algorithm , 2012, 2012 IEEE 27th Conference on Computational Complexity.

[10]  Benjamin Rossman,et al.  The Monotone Complexity of k-clique on Random Graphs , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[11]  Shachar Lovett,et al.  Improved bounds for the sunflower lemma , 2019, Electron. Colloquium Comput. Complex..

[12]  Leon Gordon Kraft,et al.  A device for quantizing, grouping, and coding amplitude-modulated pulses , 1949 .

[13]  Anna Gál,et al.  The Cell Probe Complexity of Succinct Data Structures , 2003, ICALP.

[14]  Michel Talagrand,et al.  Are many small sets explicitly small? , 2010, STOC '10.

[15]  Benjamin Rossman.  The Monotone Complexity of k-clique on Random Graphs , 2010, FOCS.