Skip to content

Tridimensional character sums with polynomial arguments and applications

Étienne Fouvry, Igor E. Shparlinski, Ping Xi

math.NTarXiv:2610.01524

Abstract

Let p be a large prime and χ a non-trivial Dirichlet character modulo p. We study the character sum \[ Σa A Σb B Σc C α(a,b) β(c)χ(f(a) + bc), \] where z Z means Z z < 2Z, f ∈ Z[X] is of small degree k, and α=(α(a,b))a A,b B and β=(β(c))c C are two complex coefficients. We prove non-trivial upper bounds for this sum in either of the two cases: (1) β1, k=2,3,4,5 and A,B,C>p18+, (2) β general, k=2,3 and A,B,C>p16+, where >0 is fixed. This work was originally motivated by an intermediate result of Ganguly and Rajan (2023) on counting 2×2 matrices over Fp with irreducible characteristic polynomials, where the entries are in short segments. The new bounds here allow us to count such matrices in much shorter segments.

Create a lesson