Sunflower conjecture in (Z/DZ)n(\mathbb Z/D\mathbb Z)^n

Let kDk\leq D, and let A(Z/DZ)nA\subset(\mathbb Z/D\mathbb Z)^n. A collection of vectors is a kk-sunflower if, in every coordinate, its entries are either all different or all equal; AA is kk-sunflower-free if it contains no such collection. Sunflower conjecture in (Z/DZ)n(\mathbb Z/D\mathbb Z)^n. There is a constant bkb_k, depending only on kk, such that

Abkn.|A|\leq b_k^n.

For k=3k=3 and D=3D=3, the sunflower condition is equivalent to being a three-term arithmetic progression in F3n\mathbb F_3^n. 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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.