A quantitative bound for Szemerédi's theorem for a complexity one polynomial progression over \(\mathbb{Z} /N \mathbb{Z}\) (Q6930459)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 8092732
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A quantitative bound for Szemerédi's theorem for a complexity one polynomial progression over \(\mathbb{Z} /N \mathbb{Z}\) |
scientific article; zbMATH DE number 8092732 |
Statements
A quantitative bound for Szemerédi's theorem for a complexity one polynomial progression over \(\mathbb{Z} /N \mathbb{Z}\) (English)
0 references
12 September 2025
0 references
higher order Fourier analysis
0 references
Szemeredi's theorem
0 references
arithmetic combinatorics
0 references
