Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case

DOI10.19086/DA.1282zbMATH Open1404.11114OpenAlexW2348244329MaRDI QIDQ4645010FDOQ4645010

Authors Sean M. Prendiville

Publication date 9 January 2019

Published in Discrete Analysis (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Arithmetic progressions (11B25) Arithmetic combinatorics; higher degree uniformity (11B30) Primes in congruence classes (11N13)

Abstract: We obtain quantitative bounds in the polynomial Szemer'edi theorem of Bergelson and Leibman, provided the polynomials are homogeneous and of the same degree. Such configurations include arithmetic progressions with common difference equal to a perfect kth power.

Recommendations

• Further bounds in the polynomial Szemerédi theorem over finite fields
• scientific article; zbMATH DE number 878893
• Bounds for sets with no polynomial progressions
• Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
• A Hardy field extension of Szemerédi's theorem

Cites work

• scientific article; zbMATH DE number 5528961 (Why is no real title available?)
• scientific article; zbMATH DE number 3380629 (Why is no real title available?)
• A maximal extension of the best-known bounds for the Furstenberg-Sárközy theorem
• A new proof of Szemerédi's theorem
• A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
• Arithmetic Progressions in Sparse Sets
• Combinatorial Proofs of the Polynomial van der Waerden Theorem and the Polynomial Hales-Jewett Theorem
• Concatenation theorems for anti-Gowers-uniform functions and Host-Kra characteristic factors
• Fourier analysis and Szemerédi's theorem
• ON THE DISTRIBUTION OF THE SEQUENCE n2  (mod 1)
• On Certain Sets of Integers
• On arithmetic structures in dense sets of integers
• On difference sets of sequences of integers. I
• On difference sets of sequences of integers. III
• On sets of integers containing k elements in arithmetic progression
• On the fractional parts of a set of points
• Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
• Primitive Recursive Bounds for Van Der Waerden Numbers
• The dichotomy between structure and randomness, arithmetic progressions, and the primes
• The primes contain arbitrarily long arithmetic progressions
• The primes contain arbitrarily long polynomial progressions
• Vinogradov's mean value theorem via efficient congruencing

Cited in

(11)

• scientific article; zbMATH DE number 891072 (Why is no real title available?)
• Further bounds in the polynomial Szemerédi theorem over finite fields
• Quantitative bounds in the nonlinear Roth theorem
• Bootstrapping partition regularity of linear systems
• scientific article; zbMATH DE number 7537999 (Why is no real title available?)
• Rado's criterion over squares and higher powers
• Three-term polynomial progressions in subsets of finite fields
• Bounds in a popular multidimensional nonlinear Roth theorem
• A polynomial Sárközy-Furstenberg theorem with upper bounds
• Companion theorems to G. Szegö's inequality for pairs of coefficients of bounded polynomials
• Bounds for sets with no polynomial progressions

This page was built for publication: Quantitative bounds in the polynomial Szemerédi theorem: the homogeneous case

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