[ Q(x) = \sum_i<j (x_i - x_j)^2 ]
[ P(\mathbfx) = \sum_i=1^n \omega^x_i \quad \text(where $\omega$ is a primitive 3rd root of unity) ] polymath 6.1 key
Prior proofs gave extremely weak bounds (e.g., Ackermann-type or tower-of-exponentials). Polymath 6.1 sought to reduce the tower height. [ Q(x) = \sum_i<j (x_i - x_j)^2 ]
or more combinatorially:
