Distinction between hyper-Kloosterman sums and multiplicative functions

Abstract

Let n(a,b;m) be the hyper-Kloosterman sum. Fix integers n≥slant2,a≠0, b≠0 and k≥slant2. For any 0≠η∈C and multiplicative function f: N → C, we prove that n(a,b;m)≠η f(m) holds for 100\% square-free k-almost prime numbers m and 100\% square-free numbers m. Counterintuitively, if n(a,b;p)=η f(p) holds for all but finitely many primes p, we further show that align* |\m≤slant X:n(a,b;m)=η f(m), m square-free k-almost prime\|= O(X1-1k+1). align* These results overturn the general belief that n(a,b;m) is nearly multiplicative in m, and that its distribution at almost prime moduli m closely approximates that at primes. Moreover, we prove that these results also hold for general algebraic exponential sums satisfying some natural conditions.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…