Mixed character sums modulo prime powers
Number Theory
2026-04-06 v1
Abstract
We obtain explicit estimates for the mixed character sum , where is a prime power, is a multiplicative character mod and are rational functions over . Let , in reduced form, and set where is the number of distinct complex zeros of , and for polynomial , otherwise. We show for example that for odd , any non-degenerate sum has if , and if . Analogous bounds are given for degenerate sums.
Cite
@article{arxiv.2604.02614,
title = {Mixed character sums modulo prime powers},
author = {Todd Cochrane and Andrew Granville},
journal= {arXiv preprint arXiv:2604.02614},
year = {2026}
}