Large sieve inequality for sums of Legendre symbols over short intervals
Igor Shparlinski, Yixiu Xiao

TL;DR
This paper establishes a new upper bound on the second moment of sums of Legendre symbols over short intervals, extending previous results and providing power savings under certain conditions.
Contribution
It introduces a novel bound using the Burgess bound and Selberg sieve, generalizing Heath-Brown's earlier work on quadratic character sums.
Findings
Bound is nontrivial and offers power savings for h ≥ ψ(Q)
Generalizes Heath-Brown's results to arbitrary starting points u
Applicable to sums over short intervals in prime moduli
Abstract
We use the Burgess bound and Selberg sieve to obtain an upper bound on the second moment of sums over an interval of Legendre symbols modulo primes in a dyadic interval . The bound is nontrivial and gives a power saving with respect to for any , provided for any function as . This can be viewed as a generalisation of a result of D. R. Heath-Brown (1995) on moments of sums or quadratic characters over the initial interval .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
