Papers
Topics
Authors
Recent
Search
2000 character limit reached

Sign changes of Kloosterman sums with almost prime moduli

Published 31 Oct 2013 in math.NT | (1310.8623v3)

Abstract: We prove that the Kloosterman sum S(1,1;c)S(1,1;c) can change sign infinitely often as cc runs over squarefree moduli with at most 10 prime factors, which improves the previous results of E. Fouvry and Ph. Michel, J. Sivak-Fischler and K. Matom\"{a}ki, replacing 10 by 23, 18 and 15, respectively. The method combines the Selberg sieve, equidistribution of Kloosterman sums and spectral theory of automorphic forms.

Authors (1)
Citations (6)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.