Related papers: On Kloosterman sums with multiplicative coefficien…

For any given positive definite binary quadratic form $Q$ with integer coefficients, we establish two results on Diophantine approximation with integers represented by $Q$. Firstly, we show that for every irrational number $\alpha$, there…

Let $\mathtt{PRIMES}$ be the set of all primes. We show that a multiplicative function which satisfies \[ f(p+q-2) = f(p) + f(q) - f(2) \text{ for }p,q \in \mathtt{PRIMES} \] is one of the following: \begin{enumerate} \item $f$ is the…

Let $c_q(n)$ be the Ramanujan sums and let $S(m,n;q)$ be the Kloosterman sums. We study the eigenvalues of $q \times q$ matrices whose $(m,n)$ entry is $c_q (m-n)$ or $S(m,n;q)$ where $q$ is a fixed positive integer. We also study the…

We studies the Newton polygon for the L-function of toric exponential sums attached to a family of two variable generalized hyperkloosterman sum,$f_{t}(x,y)=x^{n}+y+\frac{t}{xy}$ with $t$ the parameter. The explicit Newton polygon is…

We give an asymptotic formula for correlations \[ \sum_{n\le x}f_1(P_1(n))f_2(P_2(n))\cdot \dots \cdot f_m(P_m(n))\] where $f\dots,f_m$ are bounded "pretentious" multiplicative functions, under certain natural hypotheses. We then deduce…

Let $k$ be an integer greater than or equal $4$. We show that if a multiplicative function $f$ satisfies \[ f(x_1^2 + x_2^2 + \dots + x_k^2) = f(x_1)^2 + f(x_2)^2 + \dots + f(x_k)^2 \] for all positive integers $x_i$'s, then $f$ is the…

A set A=A_{k,n} in [n]\cup{0} is said to be an additive k-basis if each element in {0,1,...,kn} can be written as a k-sum of elements of A in at least one way. Seeking multiple representations as k-sums, and given any function phi(n), with…

A. Booker and C. Pomerance (2017) have shown that any residue class modulo a prime $p\ge 11$ can be represented by a positive $p$-smooth square-free integer $s = p^{O(\log p)}$ with all prime factors up to $p$ and conjectured that in fact…

We study the arithmetic (real) function, with f 'essentially bounded'. In particular, we obtain non-trivial bounds, through f 'correlations', for the 'Selberg integral' and the 'symmetry integral' of f in almost all short intervals…

In the previous paper [Sun23], the author proved a uniform bound for sums of half-integral weight Kloosterman sums. This bound was applied to prove an exact formula for partitions of rank modulo 3. That uniform estimate provides a more…

Assuming that the Generalized Riemann Hypothesis (GRH) holds, we prove an explicit formula for the number of representations of an integer as a sum of $k\geq 5$ primes. Our error terms in such a formula improve by some logarithmic factors…

Let $k \ge 2$ be a fixed integer. We define the multiplicative function $D_k(n) = d_k(n)/d_k^*(n)$, such that $d_k(n)$ is the Piltz divisor function and $d_k^*(n) = k^{\omega(n)}$ is its unitary analogue, where $\omega(n)$ is the number of…

We determine the order of magnitude of $\mathbb{E}|\sum_{n \leq x} f(n)|^{2q}$ up to factors of size $e^{O(q^2)}$, where $f(n)$ is a Steinhaus or Rademacher random multiplicative function, for all real $1 \leq q \leq \frac{c\log x}{\log\log…

We study Kloosterman sums in a generalized ring-theoretic context, that of finite commutative Frobenius rings. We prove a number of identities for twisted Kloosterman sums, loosely clustered around moment computations.

We give the q-analogue of the sums of the n-th powers of positive integers up to k-1.

We consider the distribution of polygonal paths joining the partial sums of normalized Kloosterman sums modulo an increasingly high power p^n of a fixed odd prime p, a pure depth-aspect analogue of theorems of Kowalski-Sawin and…

We use an elementary argument to prove some finite sums involving expressions of the forms $(q)_n$ and $(a;q)_n$ along with inductive formulas for some sequences.

Let $L$ be an even lattice of odd rank with discriminant group $L'/L$, and let $\alpha,\beta \in L'/L$. We prove the Weil bound for the Kloosterman sums $S_{\alpha,\beta}(m,n,c)$ of half-integral weight for the Weil Representation attached…

Let $f$ be an arithmetic function satisfying some simple conditions. The aim of this paper is to establish an asymptotical formula for the quantity \[ S_f(x):=\sum_{n\leq x}\frac{f([x/n])}{[x/n]} \] as $x\rightarrow\infty$, where $[t]$ is…

For a function $f\colon \mathbb{N}\to\mathbb{N}$, let $$ N^+_f(x)=\{n\leq x: n=k+f(k) \mbox{ for some } k\}. $$ Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…