Improved bounds for skew corner-free sets
Abstract
We construct skew corner-free subsets of [n]2 of size n2(-O( n)), thereby improving on recent bounds of the form (n5/4) obtained by Pohoata and Zakharov. In the other direction, we prove that any such set has size at most O(n2( n)-c) for some absolute constant c > 0. This improves on the previously best known upper bound, coming from Shkredov's work on the corners theorem.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.