Bounds in a popular multidimensional nonlinear Roth theorem

Type: Article

Publication Date: 2024-11-01

Citations: 0

DOI: https://doi.org/10.1112/jlms.70019

Abstract

Abstract A nonlinear version of Roth's theorem states that dense sets of integers contain configurations of the form , , . We obtain a multidimensional version of this result, which can be regarded as a first step toward effectivising those cases of the multidimensional polynomial Szemerédi theorem involving polynomials with distinct degrees. In addition, we prove an effective “popular” version of this result, showing that every dense set has some non‐zero such that the number of configurations with difference parameter is almost optimal. Perhaps surprisingly, the quantitative dependence in this result is exponential, compared to the tower‐type bounds encountered in the popular linear Roth theorem.

Locations

  • Journal of the London Mathematical Society - View - PDF
  • arXiv (Cornell University) - View - PDF
  • Lancaster EPrints (Lancaster University) - View - PDF

Similar Works

Action Title Year Authors
+ PDF Chat Bounds in a popular multidimensional nonlinear Roth theorem 2024 Sarah Peluse
Sean Prendiville
Xuancheng Shao
+ Quantitative bounds in the nonlinear Roth theorem 2019 Sarah Peluse
Sean Prendiville
+ A polylogarithmic bound in the nonlinear Roth theorem 2020 Sarah Peluse
Sean Prendiville
+ Polynomial Configurations in Difference Sets (Revised Version) 2009 Neil Lyall
Ákos Magyar
+ Polynomial Configurations in Difference Sets (Revised Version) 2009 Neil Lyall
Ákos Magyar
+ PDF Chat A Polylogarithmic Bound in the Nonlinear Roth Theorem 2020 Sarah Peluse
Sean Prendiville
+ Polynomial configurations in difference sets 2008 Neil Lyall
Ákos Magyar
+ Lower bounds in the polynomial Szemerédi theorem 2019 Khalid Younis
+ PDF Chat Popular Progression Differences in Vector Spaces 2019 Jacob Fox
Huy Tuan Pham
+ PDF Chat A Multidimensional Szemerédi Theorem in the Primes via Combinatorics 2018 Brian Cook
Ákos Magyar
Tatchai Titichetrakun
+ PDF Chat Polynomials vanishing on grids: The Elekes-Rónyai problem revisited 2016 Orit E. Raz
Micha Sharir
József Solymosi
+ New lower bounds for cardinalities of higher dimensional difference sets and sumsets 2021 Akshat Mudgal
+ New lower bounds for cardinalities of higher dimensional difference sets and sumsets 2022 Akshat Mudgal
+ PDF Chat Sárközy's theorem for P-intersective polynomials 2012 Alex Rice
+ Sarkozy's Theorem for P-Intersective Polynomials 2011 Alex Rice
+ Sarkozy's Theorem for P-Intersective Polynomials 2011 Alex Rice
+ PDF Chat Discrepancy of arithmetic progressions in grids 2024 Jacob Fox
Max Wenqiang Xu
Yunkun Zhou
+ Lower bounds on multiple difference sets 1991 Wende Chen
Torleiv Kløve
+ Popular progression differences in vector spaces 2017 Jacob Fox
Huy Tuan Pham
+ An Upper Bound for d -dimensional Difference Sets 2001 Yonutz V. Stanchescu

Works That Cite This (0)

Action Title Year Authors