Answers are grounded in this paper and cite their sources.
Let χ be a primitive character modulo q, and let δ > 0. Assuming that χ has large order d, for any dth root of unity α we obtain non-trivial upper bounds for the number of n ≤ x such that χ(n) = α, provided x > qδ. This improves upon a previous result of the first author by removing restrictions on q and d. As a corollary, we deduce that if the largest prime factor of d satisfies P⁺(d) → ∞ then the level set χ(n) = α has $o(x)$ such solutions whenever x > qδ, for any fixed δ > 0. Our proof relies, among other things, on a refinement of a mean-squared estimate for short sums of the characters χ^, averaged over 1 ≤ ≤ d-1, due to the first author, which goes beyond Burgess' theorem as soon as d is sufficiently large. We in fact show the alternative result that either (a) the partial sum of χ itself, or (b) the partial sum of χ^, for ``almost all'' 1 ≤ ≤ d-1, exhibits cancellation on the interval [1,qδ], for any fixed δ > 0. By an analogous method, we also show that the P\'{o}lya-Vinogradov inequality may be improved for either χ itself or for almost all χ^, with 1 ≤ ≤ d-1. In particular, our averaged estimates are non-trivial whenever χ has sufficiently large even order d.
No takes yet. Share an insight, caveat, or question.
Mangerel et al. (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: