Related papers: Involves averaging arithmetic and integral partial…

Let $\Lambda$ be the von Mangoldt function and $r_{Q}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}\Lambda\left(m_{1}\right)$ be the counting function for the numbers that can be written as sum of a prime and two squares (that we will…

In [arXiv:1504.07804], Keating, Rodgers, Roditty-Gershon and Rudnick established relationships of the mean-square of sums of the divisor function $d_k(f)$ over short intervals and over arithmetic progressions for the function field $\mathbb…

A new effective method for factorization of a class of nonrational $n\times n$ matrix-functions with \emph{stable partial indices} is proposed. The method is a generalization of the one recently proposed by the authors which was valid for…

Gonek, Graham, and Lee have shown recently that the Riemann Hypothesis (RH) can be reformulated in terms of certain asymptotic estimates for twisted sums with von Mangoldt function $\Lambda$. Building on their ideas, for each…

We analyze the sequence of polynomials defined by the differential-difference equation $P_{n+1}(x)=P_{n}^{\prime}(x)+x(n+1)P_{n}(x)$ asymptotically as $n\to\infty$. The polynomials $P_{n}(x)$ arise in the computation of higher derivatives…

Let $f\colon\mathbb{N}\rightarrow\mathbb{C}$ be an arithmetic function and consider the Beatty set $\mathcal{B}(\alpha) = \lbrace\, \lfloor n\alpha \rfloor : n\in\mathbb{N} \,\rbrace$ associated to a real number $\alpha$, where…

We demonstrate how the asymptotics for large $|z|$ of the generalised Bessel function \[{}_0\Psi_1(z)=\sum_{n=0}^\infty\frac{z^n}{\Gamma(an+b) n!},\] where $a>-1$ and $b$ is any number (real or complex), may be obtained by exploiting the…

Let $f_1,\ldots,f_k : \mathbb{N} \rightarrow \mathbb{C}$ be multiplicative functions taking values in the closed unit disc. Using an analytic approach in the spirit of Hal\'{a}sz' mean value theorem, we compute multidimensional averages of…

An arithmetic function $f$ is called a sieve function of range $Q$, if it is the convolution product of the constantly $1$ function and $g$ such that $g(q)\ll_{\varepsilon} q^{\varepsilon}$, $\forall\varepsilon>0$, for $q\leq Q$, and…

This paper concerns the asymptotic behavior of a random variable $W_\lambda$ resulting from the summation of the functionals of a Gibbsian spatial point process over windows $Q_\lambda \uparrow R^d$. We establish conditions ensuring that…

Let $I$ be a graded ideal of a standard graded polynomial ring $S$ with coefficients in a field $K$. The asymptotic behaviour of the $\text{v}$-number of the powers of $I$ is investigated. Natural lower and upper bounds which are linear…

We prove uniform versions of two classical results in analytic number theory. The first is an asymptotic for the number of points of a complete lattice $\Lambda \subseteq \mathbb{R}^d$ inside the $d$-sphere of radius $R$. In contrast to…

We present a class of multiplicative functions $f:\mathbb{N}\to\mathbb{C}$ with bounded partial sums. The novelty here is that our functions do not need to have modulus bounded by $1$. The key feature is that they pretend to be the constant…

In this paper we obtain a series of asymptotic formulae in the sum--product phenomena over the prime field $\mathbf{F}_p$. In the proofs we use usual incidence theorems in $\mathbf{F}_p$, as well as the growth result in ${\rm SL}_2…

We study sums of a random multiplicative function; this is an example, of number-theoretic interest, of sums of products of independent random variables (chaoses). Using martingale methods, we establish a normal approximation for the sum…

We deduce asymptotic formulas for the alternating sums $\sum_{n\le x} (-1)^{n-1} f(n)$ and $\sum_{n\le x} (-1)^{n-1} \frac1{f(n)}$, where $f$ is one of the following classical multiplicative arithmetic functions: Euler's totient function,…

We define the asymptotic behavior "almost everywhere" of additive and multiplicative arithmetic functions in the paper. Classes of additive and multiplicative arithmetic functions are singled out for which the asymptotics coincides "almost…

The asymptotic behaviour of partial sums of generalized hypergeometric series of unit argument is investigated.

In this paper, we propose a general framework for the asymptotic analysis of node-based verification-based algorithms. In our analysis we tend the signal length $n$ to infinity. We also let the number of non-zero elements of the signal $k$…

We prove that if $f$ is a random completely multiplicative function, conditional $f(p)=1$ for each prime $p \le (\log x)^{2-\epsilon}$, the probability that $\sum_{1\le n \le N}f(n)\ge 0$ for all $N\le x$ is $o(1)$ as $x \rightarrow…