Corners with polynomial side length

Abstract

A P-polynomial corner, for P ∈ Z[z] a polynomial, is a triple of points (x,y),\; (x+P(z),y),\; (x,y+P(z)) for x,y,z ∈ Z. In the case where P has an integer root of multiplicity 1, we show that if A ⊂eq [N]2 does not contain any nontrivial P-polynomial corners, then |A| P N2( N)c for some absolute constant c>0. This simultaneously generalizes a result of Shkredov about corner-free sets and a recent result of Peluse, Sah, and Sawhney about sets without 3-term arithmetic progressions of common difference z2-1. The main ingredients in our proof are a multidimensional quantitative concatenation result from our companion paper arXiv:2407.08636 and a novel degree-lowering argument for box norms.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…