Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols

Nati Linial, Adi Shraibman

A subset of the integer planar grid $[N]\times [N]$ is called corner-free if it contains no triple of the form $(x,y),(x+\delta ,y),(x,y+\delta )$. It is known that such a set has a vanishi…