English

Corners with polynomial side length

Combinatorics 2024-09-04 v2 Number Theory

Abstract

A PP-polynomial corner, for PZ[z]P \in \mathbb{Z}[z] a polynomial, is a triple of points (x,y),  (x+P(z),y),  (x,y+P(z))(x,y),\; (x+P(z),y),\; (x,y+P(z)) for x,y,zZx,y,z \in \mathbb{Z}. In the case where PP has an integer root of multiplicity 11, we show that if A[N]2A \subseteq [N]^2 does not contain any nontrivial PP-polynomial corners, then APN2(logloglogN)c|A| \ll_P \frac{N^2}{(\log\log\log N)^c} for some absolute constant c>0c>0. This simultaneously generalizes a result of Shkredov about corner-free sets and a recent result of Peluse, Sah, and Sawhney about sets without 33-term arithmetic progressions of common difference z21z^2-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.

Keywords

Cite

@article{arxiv.2407.08637,
  title  = {Corners with polynomial side length},
  author = {Noah Kravitz and Borys Kuca and James Leng},
  journal= {arXiv preprint arXiv:2407.08637},
  year   = {2024}
}
R2 v1 2026-06-28T17:37:36.396Z