Diameter-free estimates for the quadratic Vinogradov mean value theorem

Let s≥3 be a natural number, let ψ(x) be a polynomial with real coefficients and degree d≥2, and let A be some large, non-empty, finite subset of real numbers. We use Es,2(A) to denote the number of solutions to the system of equations <br><br> ∑i=1s(ψ(xi)−ψ(xi+s))=∑i=1s(xi−xi+s)=0, <...

Full description

Bibliographic Details
Main Author: Mudgal, A
Format: Journal article
Language:English
Published: London Mathematical Society 2022
_version_ 1824458569305554944
author Mudgal, A
author_facet Mudgal, A
author_sort Mudgal, A
collection OXFORD
description Let s≥3 be a natural number, let ψ(x) be a polynomial with real coefficients and degree d≥2, and let A be some large, non-empty, finite subset of real numbers. We use Es,2(A) to denote the number of solutions to the system of equations <br><br> ∑i=1s(ψ(xi)−ψ(xi+s))=∑i=1s(xi−xi+s)=0, <br><br> where xi∈A for each 1≤i≤2s. Our main result shows that <br><br> Es,2(A)≪d,s|A|2s−3+ηs, <br><br> where η3=1/2, and ηs=(1/4−1/7246)⋅2−s+4 when s≥4. The only other previously known result of this flavour is due to Bourgain and Demeter, who showed that when ψ(x)=x2 and s=3, we have <br><br> E3,2(A)≪ϵ|A|3+1/2+ϵ, <br><br> for each ϵ>0. Thus our main result improves upon the above estimate, while also generalising it for larger values of s and more wide-ranging choices of ψ(x). The novelty of our estimates is that they only depend on d, s and |A|, and are independent of the diameter of A. Thus when A is a sparse set, our results are stronger than the corresponding bounds that are provided by methods such as decoupling and efficient congruencing. Consequently, our strategy differs from these two lines of approach, and we employ techniques from incidence geometry, arithmetic combinatorics and analytic number theory. Amongst other applications, our estimates lead to stronger discrete restriction estimates for sparse sequences.
first_indexed 2025-02-19T04:27:58Z
format Journal article
id oxford-uuid:2d2c6509-87d6-4b50-a45b-8264fb199ad2
institution University of Oxford
language English
last_indexed 2025-02-19T04:27:58Z
publishDate 2022
publisher London Mathematical Society
record_format dspace
spelling oxford-uuid:2d2c6509-87d6-4b50-a45b-8264fb199ad22024-12-13T15:20:55ZDiameter-free estimates for the quadratic Vinogradov mean value theoremJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:2d2c6509-87d6-4b50-a45b-8264fb199ad2EnglishSymplectic ElementsLondon Mathematical Society2022Mudgal, ALet s≥3 be a natural number, let ψ(x) be a polynomial with real coefficients and degree d≥2, and let A be some large, non-empty, finite subset of real numbers. We use Es,2(A) to denote the number of solutions to the system of equations <br><br> ∑i=1s(ψ(xi)−ψ(xi+s))=∑i=1s(xi−xi+s)=0, <br><br> where xi∈A for each 1≤i≤2s. Our main result shows that <br><br> Es,2(A)≪d,s|A|2s−3+ηs, <br><br> where η3=1/2, and ηs=(1/4−1/7246)⋅2−s+4 when s≥4. The only other previously known result of this flavour is due to Bourgain and Demeter, who showed that when ψ(x)=x2 and s=3, we have <br><br> E3,2(A)≪ϵ|A|3+1/2+ϵ, <br><br> for each ϵ>0. Thus our main result improves upon the above estimate, while also generalising it for larger values of s and more wide-ranging choices of ψ(x). The novelty of our estimates is that they only depend on d, s and |A|, and are independent of the diameter of A. Thus when A is a sparse set, our results are stronger than the corresponding bounds that are provided by methods such as decoupling and efficient congruencing. Consequently, our strategy differs from these two lines of approach, and we employ techniques from incidence geometry, arithmetic combinatorics and analytic number theory. Amongst other applications, our estimates lead to stronger discrete restriction estimates for sparse sequences.
spellingShingle Mudgal, A
Diameter-free estimates for the quadratic Vinogradov mean value theorem
title Diameter-free estimates for the quadratic Vinogradov mean value theorem
title_full Diameter-free estimates for the quadratic Vinogradov mean value theorem
title_fullStr Diameter-free estimates for the quadratic Vinogradov mean value theorem
title_full_unstemmed Diameter-free estimates for the quadratic Vinogradov mean value theorem
title_short Diameter-free estimates for the quadratic Vinogradov mean value theorem
title_sort diameter free estimates for the quadratic vinogradov mean value theorem
work_keys_str_mv AT mudgala diameterfreeestimatesforthequadraticvinogradovmeanvaluetheorem