Sign changes of Kloosterman sums with moduli having at most six prime factors
Abstract
We prove that the Kloosterman sum changes sign infinitely many times, as with at most six prime factors. As a consequence, our result improved the best known result of Xi(IMRN, 2022). The novelty of our method comes from introducing a new truncated divisor function whose selection depends on the number of prime factors of the variable, through which Kloosterman sum is controlled good enough. Our arguments contain the Selberg sieve method, spectral theory and distribution of Kloosterman sums along with previous nice works by Fouvry, Matom\"{a}ki, Michel, Sivak-Fischler and Xi.
Keywords
Cite
@article{arxiv.2411.13170,
title = {Sign changes of Kloosterman sums with moduli having at most six prime factors},
author = {Tianping Zhang and Mingxuan Zhong},
journal= {arXiv preprint arXiv:2411.13170},
year = {2026}
}
Comments
In the prior version, omitting $C_0$ from Lemma 3.4 made the bound for $R_3(X)$ too large to conclude. Using a new truncated divisor function depending on prime factors yields six rather than two. Any comments or suggestions are welcome!