On the multidimensional polynomial Szemerédi theorem

We study the multidimensional polynomial Szemerédi theorem over prime fields. Let $P_1,\dots,P_m\in\F_p[t]^k$ be block independent vector polynomials of degree at most $d$, with $P_i(0)=0$ for every $i$. We prove that there is a constant $c=c(k,m,d)>0$ such that, for every sufficiently large prime $p$, every set $A\subset\F_p^k$ with $|A|\ge p^{k-c}$ contains a configuration $x,x+P_1(t),\dots,x+P_m(t)$ with $t\in\F_p\setminus\{0\}$.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-12
DOI
https://doi.org/10.48550/arxiv.2611.17136
Primary Topic
Limits and Structures in Graph Theory
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

On the multidimensional polynomial Szemerédi theorem

Xuancheng Shao, Danqing He
arXiv (Cornell University)
Limits and Structures in Graph Theory
preprint

On the multidimensional polynomial Szemerédi theorem

Xuancheng Shao, Danqing He
preprint en

Abstract

We study the multidimensional polynomial Szemerédi theorem over prime fields. Let $P_1,\dots,P_m\in\F_p[t]^k$ be block independent vector polynomials of degree at most $d$, with $P_i(0)=0$ for every $i$. We prove that there is a constant $c=c(k,m,d)>0$ such that, for every sufficiently large prime $p$, every set $A\subset\F_p^k$ with $|A|\ge p^{k-c}$ contains a configuration $x,x+P_1(t),\dots,x+P_m(t)$ with $t\in\F_p\setminus\{0\}$.

arXiv (Cornell University)
Limits and Structures in Graph Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon