Sunflower conjecture in
Sunflower conjecture in
Let , and let . A collection of vectors is a -sunflower if, in every coordinate, its entries are either all different or all equal; is -sunflower-free if it contains no such collection. Sunflower conjecture in . There is a constant , depending only on , such that
For and , the sunflower condition is equivalent to being a three-term arithmetic progression in . The paper gives bounds for the three-sunflower case, while the stated conjecture remains open.
Sources & referencesView supporting material
Primary source
Eric Naslund and William F. Sawin, “Upper bounds for sunflower-free sets”, arXiv:1606.09575 (2016).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.