Related papers: Short Kloosterman sums to powerful modulus

Sums of Kloosterman sums have deep connections with the theory of modular forms, and their estimation has many important consequences. Kuznetsov used his famous trace formula and got a power-saving estimate with respect to $x$ with implied…

For $q$ prime, $X \geq 1$ and coprime $u,v \in \mathbb{N}$ we estimate the sums \begin{equation*} \sum_{\substack{p \leq X \substack p \equiv u \hspace{-0.25cm} \mod{v} p \text{ prime}}} \text{Kl}_2(p;q), \end{equation*} where…

We revisit a recent bound of I. Shparlinski and T. P. Zhang on bilinear forms with Kloosterman sums, and prove an extension for correlation sums of Kloosterman sums against Fourier coefficients of modular forms. We use these bounds to…

In this paper we give a modular interpretation of the $k$-th symmetric power $L$-function of the Kloosterman family of exponential sums in characteristics 2 and 3, and in the case of $p=2$ and $k$ odd give the precise 2-adic Newton polygon.…

We use the $q$-analogue of van der Corput's method to estimate short character sums to smooth moduli. If $\chi$ is a primitive Dirichlet character modulo a squarefree, $q^\delta$-smooth integer $q$ we show that $$L(\frac12,\chi)\ll_\epsilon…

We define the Kloosterman sum for $SL_4$ over the Kloosterman set via the Bruhat decomposition and stratify the Kloosterman set using the reduced word decomposition of the Weyl group element. The Kloosterman sum for an $SL_4$-long word is…

We introduce a new method to bound bilinear (Type II) sums of Kloosterman sums with composite moduli $c$, using Fourier analysis on $\mathrm{SL}_2(\mathbb{Z}/c\mathbb{Z})$ and an amplification argument with non-abelian characters. For sums…

Let $t:\mathbb{F}_{p}\rightarrow\mathbb{C}$ be a complex valued function on $\mathbb{F}_{p}$. A classical problem in analytic number theory is to bound the maximum of the absolute value of the incomplete sum \[ M(t):=\max_{0\leq…

We obtain new results on additive properties of the set $$ I^{-1}= \{x^{-1}: \quad x\in I\} $$ where $I$ is an arbitrary interval in the field of residue classes modulo a large prime $p$. We combine our results with multilinear exponential…

In this paper, we study the power mean of a sum analogous to the Kloosterman sum by using analytic methods for character sums.

In this note we study Kloosterman sums twisted by a multiplicative characters modulo a prime power. We show, by an elementary calculation, that these sums become equidistributed on the real line with respect to a suitable measure.

This paper establishes power-saving bounds for Kloosterman sums associated with the long Weyl element for GL(n), as well as for another type of Weyl element of order 2. These bounds are obtained by establishing an explicit representation as…

We obtain statistical results on the possible distribution of all partial sums of a Kloosterman sum modulo a prime, by computing explicitly the support of the limiting random Fourier series of our earlier functional limit theorem for…

We obtain several asymptotic formulas for the sum of the divisor function $\tau(n)$ with $n \le x$ in an arithmetic progressions $n \equiv a \pmod q$ on average over $a$ from a set of several consecutive elements from set of reduced…

We give two quantum algorithms for computing (twisted) Kloosterman sums attached to a finite field $\mathbf{F}$ of $q$ elements. The first algorithm computes a quantum state containing, as its coefficients with respect to the standard…

In this paper, we construct the binary linear codes $C(SL(n,q))$ associated with finite special linear groups $SL(n,q)$, with both \emph{n,q} powers of two. Then, via Pless power moment identity and utilizing our previous result on the…

We establish power-saving estimates for general bilinear forms with Kloosterman sums modulo arbitrary q, including when both variables are shorter than the Polya-Vinogradov range. As an application, we obtain power-saving asymptotics for…

We prove non-trivial bounds for bilinear forms with hyper-Kloosterman sums with characters modulo a prime $q$ which, for both variables of length $M$, are non-trivial as soon as $M\geq q^{3/8+\delta}$ for any $\delta>0$. This range, which…

We give a substantial improvement for the error term in the asymptotic formula for the smallest parts function $\mathrm{spt}(n)$ of Andrews. Our methods depend on an explicit bound for sums of Kloosterman sums of half integral weight on the…

In this paper, we construct a binary linear code connected with the Kloosterman sum for $GL(2,q)$. Here $q$ is a power of two. Then we obtain a recursive formula generating the power moments 2-dimensional Kloosterman sum, equivalently that…