Mean values of character sums analogue of Kloosterman sums
Ping Xi

TL;DR
This paper investigates the average behavior of a character sum analogue of Kloosterman sums, focusing on mean square values and bilinear forms, extending understanding of these sums in number theory.
Contribution
It introduces new results on mean square values and bilinear forms for character sum analogues of Kloosterman sums, advancing the theoretical framework in this area.
Findings
Established mean square value estimates for the sums.
Derived bounds for bilinear forms involving these sums.
Extended classical results to character sum analogues.
Abstract
Let be a positive integer, a nontrivial character mod , an interval of length not exceeding In this paper we shall study the character sum analogue of the well-known Kloosterman sum,\[\sum_{\substack{a\in\mathcal{I} \gcd(a,q)=1}}\chi(ma+n\overline{a}),\] where is the multiplicative inverse of . The mean square values and bilinear forms for such sums are proved.
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
TopicsAnalytic Number Theory Research · Coding theory and cryptography · Finite Group Theory Research
