Related papers: On the support of the Kloosterman paths
In this paper, we give the central limit theorem and almost sure central limit theorem for products of some partial sums of independent identically distributed random variables.
We first show joint uniform distribution of values of Kloosterman sums or Birch sums among all extensions of a finite field $\mathbb{F}_q$, for almost all couples of arguments in $\mathbb{F}_q^\times$, as well as lower bounds on…
For $m,n>0$ and $mn<0$ we estimate the sums \begin{equation*} \sum_{c \leq x} \frac{S(m,n,c,\chi)}{c}, \end{equation*} where the $S(m,n,c,\chi)$ are Kloosterman sums attached to a multiplier $\chi$ of weight $1/2$ on the full modular group.…
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…
Numerical study of the distribution of the Riemann zeros differences following the work [1] shows the significance of the function for which the prime sum expression is proposed. Computational results related to this definition explored…
In this paper, we investigated the Fourier partial sums with respect to general orthonormal systems when the function $f$ belongs to some differentiable class of functions
We provide the analytic forms of the distributions for the sum of ordered spacings. We do this both for the case where the boundaries are included in the calculation of the spacings and the case where they are excluded. Both the probability…
We prove several results regarding the distribution of numbers that are the product of a prime and a $k$-th power. First, we prove an asymptotic formula for the counting function of such numbers; this generalises a result of E. Cohen. We…
We study the divisibility by 3^k of Kloosterman sums K(a) over finite fields of characteristic 3. We give a new recurrent algorithm for finding the largest k, such that 3^k divides the Kloosterman sum K(a). This gives a new simple test for…
We obtain the analogue of the classical result by Erd\"os and Kac on the limiting distribution of the maximum of partial sums for exchangeable random variables with zero mean and variance one. We show that, if the conditions of the central…
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…
We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.
Consider a multiplicative function f(n) taking values on the unit circle. Is it possible that the partial sums of this function are bounded? We show that if we weaken the notion of multiplicativity so that f(pn)=f(p)f(n) for all primes p in…
We consider the distribution of quadratic Gauss paths, polygonal paths joining partial sums of quadratic Gauss sums to square-free fundamental discriminant moduli in a dyadic range [Q,2Q]. We prove that this striking ensemble converges in…
Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…
Kloosterman sums play a special role in analytic number theory, for expressing the integer Fourier coefficients of modular forms as an infinite sum of Bessel functions, also known as Rademacher formula. The generalization to vector-valued…
We bound double sums of Kloosterman sums over a finite field ${\mathbb F}_{q}$, with one or both parameters ranging over an affine space over its prime subfield ${\mathbb F}_p \subseteq {\mathbb F}_{q} $. These are finite fields analogues…
Let $a,b\in \mathbb{N}$ be fixed and coprime such that $a>b$, and let $N$ be any number of the form $a^n\pm b^n$, $n\in\mathbb{N}$. We will generalize a result of Bostan, Gaudry and Schost and prove that we may compute the prime…
Let $\alpha$ be a Steinhaus or a Rademacher random multiplicative function. For a wide class of multiplicative functions $f$ we show that the sum $\sum_{n \le x}\alpha(n) f(n)$, normalised to have mean square $1$, has a non-Gaussian…
The problem of iterated partial summations is solved for some discrete distributions defined on discrete supports. The power method, usually used as a computational approach to finding matrix eigenvalues and eigenvectors, is in some cases…