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 a similar bound. Our bound shows that there is a constant \$\alpha\$ such that any family of \$(\alpha p \log(pk))^k\$ sets of size \$k\$ must contain a \$p\$-sunflower.
The UW combinatorics seminar is inviting you to a scheduled Zoom meeting.
Topic: UW combinatorics seminar: Anup Rao
Time: Apr 15, 2020 03:30 PM Pacific Time (US and Canada)
Join Zoom Meeting
https://washington.zoom.us/j/294371899
Meeting ID: 294 371 899
One tap mobile
+16699006833,,294371899# US (San Jose)
+17209289299,,294371899# US (Denver)
Dial by your location
+1 669 900 6833 US (San Jose)
+1 720 928 9299 US (Denver)
+1 971 247 1195 US (Portland)
+1 213 338 8477 US (Los Angeles)
+1 346 248 7799 US (Houston)
+1 602 753 0140 US (Phoenix)
+1 669 219 2599 US (San Jose)
+1 267 831 0333 US
+1 301 715 8592 US
+1 312 626 6799 US (Chicago)
+1 470 250 9358 US (Atlanta)
+1 470 381 2552 US (Atlanta)
+1 646 518 9805 US (New York)
+1 646 876 9923 US (New York)
+1 651 372 8299 US
+1 786 635 1003 US (Miami)
+1 253 215 8782 US
Meeting ID: 294 371 899
Find your local number: https://washington.zoom.us/u/anzn3BELm
Join by SIP
294371899@zoomcrc.com
Join by H.323
162.255.37.11 (US West)
162.255.36.11 (US East)
221.122.88.195 (China)
115.114.131.7 (India Mumbai)
115.114.115.7 (India Hyderabad)
213.19.144.110 (EMEA)
103.122.166.55 (Australia)
209.9.211.110 (Hong Kong)
64.211.144.160 (Brazil)
69.174.57.160 (Canada)
207.226.132.110 (Japan)
Meeting ID: 294 371 899