2020
DOI: 10.4064/aa181207-23-9
|View full text |Cite
|
Sign up to set email alerts
|

Bounds for discrete moments of Weyl sums and applications

Abstract: We prove two bounds for discrete moments of Weyl sums. The first one can be obtained using a standard approach. The second one involves an observation how this method can be improved, which leads to a sharper bound in certain ranges. The proofs both build on the recently proved main conjecture for Vinogradov's mean value theorem.We present two selected applications: First, we prove a new kth derivative test for the number of integer points close to a curve by an exponential sum approach. This yields a stronger… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

1
10
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 9 publications
(11 citation statements)
references
References 23 publications
(59 reference statements)
1
10
0
Order By: Relevance
“…This was proved by the second author as [22,Thm. 1.2] with k + 1 instead of k − 1, thus confirming [15,Conjecture 21] with ω = 1/k(k + 1). Some improvements over the bound (2.6) have been obtained by the first author using Weyl sums estimates and the recent breakthroughs in Vinogradov's mean value theorem from [6,28] and its generalizations to general polynomials of several variables [23].…”
Section: 2supporting
confidence: 65%
See 1 more Smart Citation
“…This was proved by the second author as [22,Thm. 1.2] with k + 1 instead of k − 1, thus confirming [15,Conjecture 21] with ω = 1/k(k + 1). Some improvements over the bound (2.6) have been obtained by the first author using Weyl sums estimates and the recent breakthroughs in Vinogradov's mean value theorem from [6,28] and its generalizations to general polynomials of several variables [23].…”
Section: 2supporting
confidence: 65%
“…), but we are still far away from proving this conjecture even for polynomials in one variable. It was conjectured in [15] that for the one-dimensional case ℓ = 1, one should be able to reach 1) . This was proved by the second author as [22,Thm.…”
Section: 2mentioning
confidence: 99%
“…Remark 3.4. We note that [16,Theorem 9] implies a slightly weaker version of (3.4). Our improvement is due to the fact that we enter the details of the proof of [30,Theorem 5.2].…”
Section: 2mentioning
confidence: 96%
“…The range where it improves all the previous bounds becomes non empty as soon as k ≥ 4 and covers almost the whole range except the corners. Additionally it is a step towards Conjecture 21 raised in [5].…”
Section: Introductionmentioning
confidence: 99%