Roth's theorem on progressions revisited
From MaRDI portal
Publication:940788
DOI10.1007/s11854-008-0020-xzbMath1155.11011OpenAlexW2083670163WikidataQ56341561 ScholiaQ56341561MaRDI QIDQ940788
Publication date: 3 September 2008
Published in: Journal d'Analyse Mathématique (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11854-008-0020-x
Related Items (39)
Logarithmic bounds for Roth's theorem via almost-periodicity ⋮ Generalizations of Fourier analysis, and how to apply them ⋮ A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1. ⋮ ON A DIAGONAL QUADRIC IN DENSE VARIABLES ⋮ New applications of the polynomial method: The cap set conjecture and beyond ⋮ On certain other sets of integers ⋮ A probabilistic technique for finding almost-periods of convolutions ⋮ A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression. II ⋮ A generalization of Roth's theorem in function fields ⋮ A new lower bound for van der Waerden numbers ⋮ Tower-type bounds for Roth's theorem with popular differences ⋮ Roth's theorem and the Hardy-Littlewood majorant problem for thin subsets of primes ⋮ Roth-type theorem for quadratic system in Piatetski-Shapiro primes ⋮ Restricted problems in extremal combinatorics ⋮ NEW BOUNDS FOR SZEMERÉDI'S THEOREM, III: A POLYLOGARITHMIC BOUND FOR ⋮ Threshold functions and Poisson convergence for systems of equations in random sets ⋮ On Roth's theorem on progressions ⋮ Unnamed Item ⋮ The structure theory of set addition revisited ⋮ An improved construction of progression-free sets ⋮ Some Ramsey-type results for the \(n\)-cube ⋮ Nil Bohr\(_0\)-sets and polynomial recurrence ⋮ ON IMPROVING ROTH'S THEOREM IN THE PRIMES ⋮ On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions ⋮ Roth's theorem in many variables ⋮ ADDITIVE DIMENSION AND A THEOREM OF SANDERS ⋮ ROTH’S THEOREM FOR FOUR VARIABLES AND ADDITIVE STRUCTURES IN SUMS OF SPARSE SETS ⋮ What is good mathematics? ⋮ Improved bound in Roth's theorem on arithmetic progressions ⋮ A Prime Analogue of Roth’s Theorem in Function Fields ⋮ A generalization of sets without long arithmetic progressions based on Szekeres algorithm ⋮ A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression ⋮ Fermat’s Last Theorem Implies Euclid’s Infinitude of Primes ⋮ Roth's theorem in the Piatetski-Shapiro primes ⋮ Bounds in Cohen's idempotent theorem ⋮ A GENERALIZATION OF ROTH'S THEOREM IN FUNCTION FIELDS ⋮ Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition ⋮ A Roth-type theorem with mixed powers ⋮ From harmonic analysis to arithmetic combinatorics
Cites Work
This page was built for publication: Roth's theorem on progressions revisited
