Indexed metadata

Tridimensional character sums with polynomial arguments and applications

Étienne Fouvry, Igor E. Shparlinski, Ping Xi

Source record

Source: arXiv

Published: Oct 1, 2026

arXiv: 2610.01524

Open original source ↗

Source abstract

Let pp be a large prime and χχ a non-trivial Dirichlet character modulo pp. We study the character sum ∑a∼A∑b∼B∑c∼Cα(a,b)β(c)χ(f(a)+bc), \sum_{a \sim A} \sum_{b \sim B} \sum_{c \sim C} α(a,b) β(c)χ(f(a) + bc), where z∼Zz \sim Z means Z≤zp18+εZ\le z p^{\frac{1}{8}+\varepsilon}, (2) β\boldsymbolβ general, k=2,3k=2,3 and A,B,C>p16+εA,B,C>p^{\frac{1}{6}+\varepsilon}, where ε>0\varepsilon>0 is fixed. This work was originally motivated by an intermediate result of Ganguly and Rajan (2023) on counting 2×22\times2 matrices over Fp\mathbb{F}_p 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.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.