REVIEW 1 cited by
Efficient equidistribution of periodic nilsequences and applications
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
abstract
This is a companion paper to arXiv:2312.10772. We deduce an equidistribution theorem for periodic nilsequences and use this theorem to give two applications in arithmetic combinatorics. The first application is quasi-polynomial bounds for a certain complexity one polynomial progression, improving the iterated logarithm bound previusly obtained. The second application is a proof of the quasi-polynomial $U^4[N]$ inverse theorem. In work with Sah and Sawhney, we obtain improved bounds for sets lacking nontrivial $5$-term arithmetic progressions.
Forward citations
Cited by 1 Pith paper
-
On polynomial progressions via transference
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.
Discussion (0). Continue with ORCID to comment.