Mathematika · 2019 · 11 citations · 13 references
Natural SciencesMathematicsNumber TheoryAlgebraic Number TheoryCombinatorial Number TheoryGalois TheoryModular ArithmeticModular FormsNumber-theoretic AlgorithmsArithmetic Functions Modulo Prime
We obtain a non-trivial bound for cancellations between the Kloosterman sums modulo a large prime power with a prime argument running over very short intervals, which in turn is based on a new estimate on bilinear sums of Kloosterman sums. These results are analogues of those obtained by various authors for Kloosterman sums modulo a prime. However, the underlying technique is different and allows us to obtain non-trivial results starting from much shorter ranges.
13
An elementary method in prime number theory
R. C. Vaughan · Acta Arithmetica · 1980 · 112 citations · Full text
ALGEBRAIC TRACE FUNCTIONS OVER THE PRIMES
2014 · 79 citations
ON MOMENTS OF TWISTED L-FUNCTIONS
2015 · 60 citations · Full text