English

Improved bounds for skew corner-free sets

Combinatorics 2025-04-30 v1 Number Theory

Abstract

We construct skew corner-free subsets of [n]2[n]^2 of size n2exp(O(logn))n^2\exp(-O(\sqrt{\log n})), thereby improving on recent bounds of the form Ω(n5/4)\Omega(n^{5/4}) obtained by Pohoata and Zakharov. In the other direction, we prove that any such set has size at most O(n2(logn)c)O(n^2(\log n)^{-c}) for some absolute constant c>0c > 0. This improves on the previously best known upper bound, coming from Shkredov's work on the corners theorem.

Keywords

Cite

@article{arxiv.2402.19169,
  title  = {Improved bounds for skew corner-free sets},
  author = {Adrian Beker},
  journal= {arXiv preprint arXiv:2402.19169},
  year   = {2025}
}

Comments

15 pages

R2 v1 2026-06-28T15:04:36.586Z