Related papers: Multiplicative functions resembling the M\"{o}bius…

Let $N$ be a large prime and let $c > 1/4$. We prove that if $f$ is a $\pm 1$-valued completely multiplicative function, such that the exponential sums $$ S_f(a) := \sum_{1 \leq n < N} f(n) e(na/N), \quad a \pmod{N} $$ satisfy the ``Gauss…

We study two models of random multiplicative functions: Rademacher random multiplicative functions supported on the squarefree integers $f$, and Rademacher random completely multiplicative functions $f^*$. We prove that the partial sums…

In this paper we study the following problem: for a given bounded positive function $f$ on a filtered probability space can we find another function (a multiplier) $m$, $0\le m\le 1$, such that the function $mf$ is not ``too small'' but its…

Let $m$ be a positive integer, and define $$\zeta_m(s)=\sum_{n=1}^\infty\frac{(-e^{2\pi i/m})^{\omega(n)}}{n^s}\ \ \ \ \text{and} \ \ \ \ \zeta^*_m(s)=\sum_{n=1}^\infty\frac{(-e^{2\pi i/m})^{\Omega(n)}}{n^s},$$ for $\Re(s)>1$, where…

We prove a strong simultaneous Diophantine approximation theorem for values of additive and multiplicative functions provided that the functions have certain regularity on the primes.

When restricted to some non-negative multiplicative function, say f, bounded on primes and that vanishes on non square-free integers, our result provides us with an asymptotic for $\sum_{n \le X}f(n)/n$ with error term $O((\log…

We investigate properties of a multivariate function $E(m_1,m_2,...,m_r)$, called {\it orbicyclic}, that arises in enumerative combinatorics in counting non-isomorphic maps on orientable surfaces. $E(m_1,m_2,...,m_r)$ proves to be…

For various arithmetic functions $f:\mathbb{N} \to \mathbb{R}$, the behavior of $f(n!)$ and that of $\sum_{n\le N} f(n!)$ can be intriguing. For instance, for some functions $f$, we have ${f(n!)=\sum_{k\le n}f(k)}$, for others, we have…

Let $f$ be a multiplicative function which satisfies \[ f(a^2+b^2+c^2+d^2) = f(a^2+b^2)+f(c^2+d^2) \] for positive integers $a$, $b$, $c$, and $d$. We show that $f$ is the identity function provided that $f(3)\,f(11) \ne 0$. Otherwise,…

Let $A$ be a subset of a finite field $\mathbb{F}$. When $\mathbb{F}$ has prime order, we show that there is an absolute constant $c > 0$ such that, if $A$ is both sum-free and equal to the set of its multiplicative inverses, then $|A| <…

We say a power series $\sum_{n=0}^\infty a_n q^n$ is multiplicative if the function $n\mapsto a_n/a_1$ ($n\ge 1$) is so. In this paper, we consider multiplicative power series $f$ such that $f^2$ is also multiplicative. We find various…

In this paper, we prove power-saving bounds for the corelation of the M\"obius function with polynomial phases of degree $k$ in function fields $\mathbb{F}_p[t]$, when $p > k$. The proof relies on a new approximation result for phases of…

We show that the $L^1$ norm of an exponential sum of length $X$ and with coefficients equal to the Liouville or M\"{o}bius function is at least $\gg_{\varepsilon} X^{1/4 - \varepsilon}$ for any given $\varepsilon$. For the Liouville…

We say that a function $\alpha(x)$ belongs to the set ${\bf A}^{(\gamma)}$ if it has an asymptotic expansion of the form $\alpha(x)\sim \sum^\infty_{i=0}\alpha_ix^{\gamma-i}$ as $x\to\infty$, which can be differentiated term by term…

Let $p$ be an odd prime and let $f(x)=\sum_{i=1}^ka_ix^{p^{\alpha_i}+1}\in\Bbb F_{p^n}[x]$, where $0\le \alpha_1<...<\alpha_k$. We consider the exponential sum $S(f,n)=\sum_{x\in\Bbb F_{p^n}}e_n(f(x))$, where $e_n(y)=e^{2\pi…

Let $\Omega(n)$ denote the number of prime factors of $n$. We show that for any bounded $f\colon\mathbb{N}\to\mathbb{C}$ one has \[ \frac{1}{N}\sum_{n=1}^N\, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N\, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1).…

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 establish an asymptotic formula for the logarithmic mean value of a 1-bounded multiplicative function that is sharp in many cases of interest. We derive from it a variety of applications, making progress on several old problems. As a…

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,…

An elementary recursive relation for M$\ddot{\mathrm{o}}$bius function $\mu (n)$ is introduced by two simple ways. With this recursive relation, $\mu (n)$ can be calculated without directly knowing the factorization of the $n$. $\mu (1)…