Related papers: Improved bounds for the two-point logarithmic Chow…

Let $A_f(1,n)$ be the normalized Fourier coefficients of a $GL(3)$ Maass cusp form $f$ and let $a_g(n)$ be the normalized Fourier coefficients of a $GL(2)$ cusp form $g$. Let $\lambda(n)$ be either $A_f(1,n)$ or the triple divisor function…

We give a new proof of Fatou's theorem: {\em if an algebraic function has a power series expansion with bounded integer coefficients, then it must be a rational function.} This result is applied to show that for any non--trivial completely…

The Cram\'er-Granville conjecture is an upper bound on prime gaps, $g_n = p_{n+1} - p_n < \cCramer \, \log^2 p_n$ for some constant $\cCramer \geq 1$. Using a formula of Selberg, we first prove the weaker summed version: $\sum_{n=1}^N g_n <…

In 1977 Montgomery and Vaughan gave tight bounds for exponential sums of the form $\sum_{n\leq x}f(n)e(n\alpha)$ where $f$ is a $1$-bounded multiplicative function and $\alpha\in\mathbb R$, close to the conjectured $\ll \frac{x}{\sqrt{q}}+…

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…

The function $Q(x):=\sum_{n\ge 1} (1/n) \sin(x/n)$ was introduced by Hardy and Littlewood [10] in their study of Lambert summability, and since then it has attracted attention of many researchers. In particular, this function has made a…

For each positive integer $n$, we denote by $\omega^*(n)$ the number of shifted-prime divisors $p-1$ of $n$, i.e., \[\omega^*(n):=\sum_{p-1\mid n}1.\] First introduced by Prachar in 1955, this function has interesting applications in…

Let $\overline{p}(n)$ denote the overpartition function. In this paper, we obtain an inequality for the sequence $\Delta^{2}\log \ \sqrt[n-1]{\overline{p}(n-1)/(n-1)^{\alpha}}$ which states that \begin{equation*} \log…

Let $\Omega_n$ stand for the volume of the unit ball in $\mathbb{R}^n$ for $n\in\mathbb{N}$. In the present paper, we prove that the sequence $\Omega_{n}^{1/(n\ln n)}$ is logarithmically convex and that the sequence…

Let $p(n)$ denote the partition function. DeSalvo and Pak proved that $\frac{p(n-1)}{p(n)}\left(1+\frac{1}{n}\right)> \frac{p(n)}{p(n+1)}$ for $n\geq 2$, as conjectured by Chen. Moreover, they conjectured that a sharper inequality…

The Chowla conjecture asserts that the values of the Liouville function form a normal sequence of plus and minus ones. Reinterpreted in the language of ergodic theory it asserts that the Liouville function is generic for the Bernoulli…

We show that there is a permutation $f$ of the positive integers such that for $n \geq 2,$ l.c.m.$(f(n), f(n+1)) \leq cn(\log n)^2,$ where $c$ is a positive constant. It improves previous results of Erd\"os, Freud and Hegyvari (1983), and…

We consider $\omega(n)$ and $\Omega(n)$, which respectively count the number of distinct and total prime factors of $n$. We survey a number of similarities and differences between these two functions, and study the summatory functions…

The logarithmic coefficients $\gamma_n$ of an analytic and univalent function $f$ in the unit disk $\mathbb{D}=\{z\in\mathbb{C}:|z|<1\}$ with the normalization $f(0)=0=f'(0)-1$ are defined by $\log \frac{f(z)}{z}= 2\sum_{n=1}^{\infty}…

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

This is a conitunation of [1] and [2]. We prove that if function $f$ belongs to the class $\Lambda_{\omega} \overset{\text{def}}{=} \{f: \omega_{f}(\delta)\leq \text{const} \omega(\delta)\} $ for an arbitrary modulus of continuity $\omega$,…

We show that the counting function of the set of values of the Carmichael $\lambda$-function is $x/(\log x)^{\eta+o(1)}$, where $\eta=1-(1+\log\log 2)/(\log 2)=0.08607...$.

A well-known conjecture asserts that, for any given positive real number $\lambda$ and nonnegative integer $m$, the proportion of positive integers $n \le x$ for which the interval $(n,n + \lambda\log n]$ contains exactly $m$ primes is…

Let $\mathbf{P} \subset [H_0,H]$ be a set of primes, where $\log H_0 \geq (\log H)^{2/3 + \epsilon}$. Let $\mathscr{L} = \sum_{p \in \mathbf{P}} 1/p$. Let $N$ be such that $\log H \leq (\log N)^{1/2-\epsilon}$. We show there exists a subset…

Let $C=\inf (k/n)\sum_{i=1}^n x_i(x_{i+1}+\dots+x_{i+k})^{-1}$, where the infimum is taken over all pairs of integers $n\geq k\geq 1$ and all positive $x_1,\dots,x_{n+k}$ subject to cyclicity assumption $x_{n+i}=x_i$, $i=1,\dots,k$. We…