Pith. sign in

REVIEW 2 cited by

Corners with polynomial side length

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.08637 v2 pith:IQRQXMIB submitted 2024-07-11 math.CO math.NT

classification math.COmath.NT
keywords polynomialresultcornersmathbbsetsabsoluteargumentarithmetic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

A $P$-polynomial corner, for $P \in \mathbb{Z}[z]$ a polynomial, is a triple of points $(x,y),\; (x+P(z),y),\; (x,y+P(z))$ for $x,y,z \in \mathbb{Z}$. In the case where $P$ has an integer root of multiplicity $1$, we show that if $A \subseteq [N]^2$ does not contain any nontrivial $P$-polynomial corners, then $$|A| \ll_P \frac{N^2}{(\log\log\log 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 $z^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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On polynomial progressions via transference

    math.NT 2025-06 conditional novelty 8.0 of 10

    For any integer polynomial P with P(0)=0, any subset of [N] avoiding x, x+P(y), ..., x+kP(y) has size at most N (log log log N)^{-c}, with stronger bounds when P'(0)!=0.

  2. Uniform nonlinear Szemer\'{e}di theorem for corners in finite fields

    math.NT 2025-01 conditional novelty 7.0 of 10

    Corners generated by two independent rational functions in F_p^2 have the expected asymptotic count with uniform power saving p^{-1/40960}.

Pith tools