2020
DOI: 10.1112/jlms.12378
|View full text |Cite
|
Sign up to set email alerts
|

Small Gál sums and applications

Abstract: In recent years, maximizing Gál sums regained interest due to a firm link with large values of L‐functions. In the present paper, we initiate an investigation of small sums of Gál type, with respect to the L1‐norm. We also consider the intertwined question of minimizing weighted versions of the usual multiplicative energy. We apply our estimates to: (i) a logarithmic refinement of Burgess' bound on character sums, improving previous results of Kerr, Shparlinski and Yau; (ii) an improvement on earlier lower bou… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5
3

Relationship

3
5

Authors

Journals

citations
Cited by 10 publications
(12 citation statements)
references
References 34 publications
0
7
0
Order By: Relevance
“…This is joint work with Kerr and Shparlinski [8]. Finally, we remark that de la Bretèche and Munsch [2] and de la Bretèche et al [3] have improved our result building on this idea.…”
mentioning
confidence: 54%
“…This is joint work with Kerr and Shparlinski [8]. Finally, we remark that de la Bretèche and Munsch [2] and de la Bretèche et al [3] have improved our result building on this idea.…”
mentioning
confidence: 54%
“…This implies that N 40/21+2ε (E * N ) 13/15 ≪ N 4− δ 2 +2ε , which is ≪ N 4−ε/4 for a sufficiently small ε. Thus for every dyadic interval or in another words every fixed u, we have an upper bound of order N 4−ε/4 for the total contribution of z m , z n with z m , z n ≥ N 1.01 to (13).…”
Section: Proof Of Theorem 1 Part 3: Lattice Point Counting Via the Ri...mentioning
confidence: 96%
“…, z M } be the multi-set of all absolute differences {|x m − x n | : 1 ≤ m, n ≤ N, m = n}, meaning that we allow repetitions in the definition. For a given u ≤ 2rN , we wish to estimate (13) 1≤m,n≤M,…”
Section: Proof Of Theorem 1 Part 3: Lattice Point Counting Via the Ri...mentioning
confidence: 99%
“…We do not see any reason why the particular set M, arising from the multiplication table problem, should not yield the desired scaling factor, but we have not been able to prove anything in this direction. The estimate (14) seems to be even more delicate, as it does not seem that controlling the pairwise overlaps is sufficient to obtain such a result, but rather the overlaps between more than two sets would need to be controlled. We note in conclusion that there do exist results on metric Diophantine approximation with two restricted variables, most prominently in the work of Harman [22,23,24,25].…”
Section: Proof Of Theoremmentioning
confidence: 99%