A quantitative bound for Szemerédi's theorem for a complexity one polynomial progression over Z /N Z

DOI10.19086/DA.117573MaRDI QIDQ6930459zbMATH OpenFDO

Authors James Leng

Publication date 12 September 2025

Published in Discrete Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.19086/DA.117573

zbMATH Keywords

arithmetic combinatoricshigher order Fourier analysisSzemeredi's theorem

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Arithmetic combinatorics; higher degree uniformity (11B30)

Cited in

(2)

• Quantitative concatenation for polynomial box norms
• On the polynomial Szemerédi theorem in finite commutative rings

This page was built for publication: A quantitative bound for Szemerédi's theorem for a complexity one polynomial progression over \(\mathbb{Z} /N \mathbb{Z}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6930459)