Ask a Question

Prefer a chat interface with context about you and your work?

Lower bounds for corner-free sets

Lower bounds for corner-free sets

We show that for infinitely many $N$ there is a set $A \subset [N]^2$ of size $2^{-(c + o(1)) \sqrt{\log_2 N}} N^2$ not containing any configuration $(x, y), (x + d, y), (x, y + d)$ with $d \neq 0$, where $c = 2 \sqrt{2 \log_2 \frac{4}{3}} \approx 1.822\dots$.