Related papers: The structure of multiplicative functions with sma…
Let $\Omega\subset \mathbb{R}^n$ be a bounded domain that can be written as $\Omega=\bigcup_{t} \Omega_t$, where $\{\Omega_t\}_{t\in\Gamma}$ is a countable collection of domains with certain properties. In this work, we develop a technique…
We obtain new bounds, pointwisely and on average, for Dedekind sums $\mathsf{s}(\lambda,p)$ modulo a prime $p$ with $\lambda$ of small multiplicative order $d$ modulo $p$. Assuming the infinitude of Mersenne primes, the range of our results…
We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression.…
Let $S_m f$ denote the $m$-th partial sum of the Walsh-Fourier series of $f \in L^1$. For an increasing sequence $a=(a(n))_{n \geq 1}$ of positive integers, consider the arithmetic means $$ \sigma_N f:=\frac{1}{N} \sum_{n=1}^N S_{a(n)} f .…
We determine the behavior of multiplicative functions vanishing at a positive proportion of prime numbers in almost all short intervals. Furthermore we quantify "almost all" with uniform power-saving upper bounds, that is, we save a power…
We evaluate the asymptotic size of various sums of G\'al type, in particular $$S( \mathcal{M}):=\sum_{m,n\in\mathcal{M}} \sqrt{(m,n) \over [m,n]},$$ where $\mathcal{M}$ is a finite set of integers. Elaborating on methods recently developed…
Let $d_k(n) = \sum_{n_1 \cdots n_k = n}1$ be the $k$-fold divisor function. We call a function $f:\mathbb{N} \to \mathbb{C}$ a $d_k$-bounded multiplicative function, if $f$ is multiplicative and $|f(n)| \leq d_k(n)$ for every $n \in…
For set $A\subset {\mathbb {F}_p}^*$ define by ${\mathsf{sf}}(A)$ the size of the largest sum--free subset of $A.$ Alon and Kleitman showed that ${\mathsf{sf}} (A) \ge |A|/3+O(|A|/p).$ We prove that if ${\mathsf{sf}} (A)-|A|/3$ is small…
Let $F(\sigma)$ be the random Dirichlet series $F(\sigma)=\sum_{p\in\mathcal{P}} \frac{X_p}{p^\sigma}$, where $\mathcal{P}$ is an increasing sequence of positive real numbers and $(X_p)_{p\in\mathcal{P}}$ is a sequence of i.i.d. random…
Analytical expressions are derived for the position of irreducible fractions in the Farey sequence $F_N$ of order $N$ for a particular choice of $N$. The asymptotic behaviour is derived obtaining a lower error bound than in previous results…
We show that an arithmetic function which satisfies some weak multiplicativity properties and in addition has a non-decreasing or $\log$-uniformly continuous normal order is close to a function of the form $n\mapsto n^c$. As an application…
We obtain an asymptotic formula for all moments of Dirichlet $L$-functions $L(1,\chi)$ modulo $p$ when averaged over a subgroup of characters $\chi$ of size $(p-1)/d$ with $\varphi(d)=o(\log p)$. Assuming the infinitude of Mersenne primes,…
We consider a Leibniz algebra ${\mathfrak L} = {\mathfrak I} \oplus {\mathfrak V}$ over an arbitrary base field $\mathbb{F}$, being ${\mathfrak I}$ the ideal generated by the products $[x,x], x \in {\mathfrak L}$. This ideal has a…
We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…
We study for bounded multiplicative functions $f$ sums of the form \begin{align*} \sum_{\substack{n\leq x \atop n\equiv a\pmod q}}f(n), \end{align*} establishing that their variance over residue classes $a \pmod q$ is small as soon as…
We introduce an algorithm to compute the functions belonging to a suitable set ${\mathscr F}$ defined as follows: $f\in {\mathscr F}$ means that $f(s,x)$, $s\in A\subset {\mathbb R}$ being fixed and $x>0$, has a power series expansion…
The aim of this work is to illustrate a conditional result involving the exponential sums over primes in short intervals under the assumption that both the Generalized Riemann Hypothesis and the Density Hypothesis for Dirichlet…
We study the asymptotic convergence of the partial averaging method, a technique used in conjunction with the random series implementation of the Feynman-Kac formula. We prove asymptotic bounds valid for most series representations in the…
We prove that the discrete fractional integration operators along the primes \[ T^{\lambda}_{\mathbb{P}}f(x) := \sum_{p} \frac{f(x-p)}{p^{\lambda}} \cdot \log p \] are bounded $\ell^p\to \ell^{p'}$ whenever $ \frac{1}{p'} < \frac{1}{p} -…
In this paper, we study the number of additional zeros of Dirichlet $L$-function caused by multiplicity by using Asymptotic Large Sieve. Then in asymptotic terms we prove that there are more than 80.124% of zeros of the family of Dirichlet…