On character sums with determinants
\'Etienne Fouvry, Igor E. Shparlinski

TL;DR
This paper derives nontrivial bounds for weighted character sums involving determinants of 2x2 matrices modulo a prime, achieving power savings for N as small as p^{1/8+ε}, advancing understanding in character sum estimates.
Contribution
The paper introduces new bounds for character sums with determinants, improving the range of N for which nontrivial estimates are known, approaching optimality under current conjectures.
Findings
Achieved power-saving bounds for N ≥ p^{1/8+ε}
Extended techniques to more general sums with larger N
Provided evidence that bounds are close to optimal without Burgess improvements
Abstract
We estimate weighted character sums with determinants of matrices modulo a prime with entries varying over the interval . Our goal is to obtain nontrivial bounds for values of as small as possible. In particular, we achieve this goal, with a power saving, for with any fixed , which is very likely to be the best possible unless the celebrated Burgess bound is improved. By other techniques, we also treat more general sums but sometimes for larger values of .
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.
Taxonomy
TopicsFinite Group Theory Research · Limits and Structures in Graph Theory · Analytic Number Theory Research
