Note on Sunflowers
Authors: Tolson Bell, Suchakree Chueluecha, Lutz Warnke
Abstract: A sunflower with p petals consists of p sets whose pairwise intersections are identical. Building upon a breakthrough of Alweiss, Lovett, Wu, and Zhang from 2019, Rao proved that any family of (Cp\log(pk))^k distinct k-element sets contains a sunflower with p petals, where C>0 is a constant; this bound was reproved by Tao. In this note we record that, by a minor variant of their probabilistic arguments, any family of (Cp\log k)^k distinct k-element sets contain a sunflower with p petals, where C>0 is a constant.
Explore the paper tree
Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant
Look for similar papers (in beta version)
By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.