Translation invariant equations and the method of Sanders

DOI10.1112/blms/bds045zbMath1277.11007arXiv1107.1110OpenAlexW2139192171MaRDI QIDQ2918796

Thomas F. Bloom

Publication date: 10 October 2012

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.1110

zbMATH Keywords

arithmetic progressionsadditive combinatoricstranslation invariant equations

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Arithmetic theory of polynomial rings over finite fields (11T55) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (9)

A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1. ⋮ A generalization of Roth's theorem in function fields ⋮ Roth-type theorem for quadratic system in Piatetski-Shapiro primes ⋮ On Systems of Complexity One in the Primes ⋮ Maximal subsets free of arithmetic progressions in arbitrary sets ⋮ ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS ⋮ Finite field models in arithmetic combinatorics -- ten years on ⋮ A Prime Analogue of Roth’s Theorem in Function Fields ⋮ A Roth-type theorem with mixed powers

This page was built for publication: Translation invariant equations and the method of Sanders