arXiv subjects
Publications and source records attributed to Andrew V. Lelechenko.
We improve existing estimates of moments of the Riemann zeta function. As a consequence, we are able to derive new estimates for the asymptotic behaviour of $\sum_{N α\le x} \mathfrak{t}_k(α)$, where $N$ stands for the norm of a complex number and $\mathfrak{t}_k$ is the $k$-dimensional divisor function on Gaussian integers.
Consider the operator $E$ on arithmetic functions such that $Ef$ is the multiplicative arithmetic function defined by $(Ef)(p^a) = f(a)$ for every prime power $p^a$. We investigate the behaviour of $E^mτ_k$, where $τ_k$ is a $k$-dimensional divisor function and $E^m$ stands for the $m$-fold iterate of $E$. We estimate the error terms of $\sum_{n\le x} E^mτ_k(n)$ for various combinations of $m$ and $k$. We also study properties of $E^mf$ for arbitrary $f$ and sufficiently large $m$. Our study provides a unified approach to functions with exponential divisors. We improve special cases of the Dirichlet asymmetric divisor problem and several results on the exponential divisor and totient functions.
N. Minculete has introduced a concept of divisors of order $r$: integer $d=p_1^{b_1}\cdots p_k^{b_k} $ is called a divisor of order $r$ of $n=p_1^{a_1}\cdots p_k^{a_k}$ if $d \mid n$ and $b_j\in\{r, a_j\}$ for $j=1,\ldots,k$. One can consider respective divisor function $τ^{(r)}$ and sum-of-divisors function $σ^{(r)}$. In the present paper we investigate the asymptotic behaviour of $\sum_{n\le x} τ^{(r)}(n)$ and $\sum_{n\le x} σ^{(r)}(n)$. We also provide conditional estimates under Riemann hypothesis.
We consider the problem of the computation of $\inf_p θp$ over the set of exponent pairs $P \ni p$ under linear constraints for a certain class of objective functions $θ$. An effective algorithm is presented. The output of the algorithm leads to the improvement and establishing new estimates in the various divisor problems in the analytic number theory.
We study the asymptotic behaviour of $\sum_{m,n\le x} τ_{1,2}(mn)$, where $τ_{1,2}(n) = \sum_{a b^2 = n} 1$, using multidimensional Perron formula and complex integration method. An asymptotic formula with an error term $O(x^{10/7})$ is obtained.
Our paper is devoted to several problems from the field of modified divisors: namely exponential and infinitary divisors. We study the behaviour of modified divisors, sum-of-divisors and totient functions. Main results concern with the asymptotic behaviour of mean values and explicit estimates of extremal orders.
Consider exponential Carmichael function $λ^{(e)}$ such that $λ^{(e)}$ is multiplicative and $λ^{(e)}(p^a) = λ(a)$, where $λ$ is usual Carmichael function. We discuss the value of $\sum λ^{(e)}(n)$, where $n$ runs over certain subsets of $[1,x]$, and provide bounds on the error term, using analytic methods and especially estimates of $\int_1^T \bigl| ζ(σ+it) \bigr|^m dt$.
Recently Tao, Croot and Helfgott invented an algorithm to determine the parity of the number of primes in a given interval in O(x^{1/2-c+\eps}) steps for some absolute constant c. We propose a slightly different approach, which leads to the implicit value of c. To achieve this aim we discuss the summation of multiplicative functions, developing sublinear algorithms and proving several general theorems.
Let $\taue_k \colon \Z\to\Z$ be a multiplicative function such that $ \taue_k(p^a) = \sum_{d_1... d_k=a} 1 $. In the present paper we introduce generalizations of $\taue_k$ over the ring of Gaussian integers $\Zi$. We determine their maximal orders by proving a general result and establish asymptotic formulas for their average orders.