Related papers: Multiplicative functions with sum zero

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…

As early as the 1930s, P\'al Erd\H{o}s conjectured that: {\em for any multiplicative function $f:\mathbb{N}\to\{-1,1\}$, the partial sums $\sum_{n\leq x}f(n)$ are unbounded.} Considering this conjecture, in this paper we consider…

We propose the construction of entire functions with a given random collection of zeros. There are considered two particular cases. In the first one we are dealing with simple zeros. And the second corresponds to random zeros with random…

Solovay proved that there exists a computable upper bound f of the prefix-free Kolmogorov complexity function K such that f (x) = K(x) for infinitely many x. In this paper, we consider the class of computable functions f such that K(x) <= f…

Classical versions of Kolmogorov complexity are incomputable. Nevertheless, in 1975 Solovay showed that there are computable functions $f > K+O(1)$ such that for infinitely many strings $\sigma$, $f(\sigma)=K(\sigma)+O(1)$, where $K$…

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

Let S be a subset of the unit disk, and let F(s) denote the class of completely multiplicative functions f such that f(p) is in S for all primes p. The authors' main concern is which numbers arise as mean-values of functions in F(s). More…

For functions of a single complex variable, points of multiplicity greater than $k$ are characterized by the vanishing of the first $k$ derivatives. There are various quantitative generalizations of this statement, showing that for…

Recently, in arXiv:1304.7895; Ukrainian Math. J. - 2014.- 66. - P. 371 - 383, we presented the generalized Li's criterion. This is the statement that the sums /lambda_(n, b, /sigma)=Sum_(rho)((1-((/rho+b)/(/rho-b-2*/sigma))^n)), taken over…

In this work we prove that certain entire $q$-functions have infinitely many nonzero roots $\left\{ \rho_{n}\right\} _{n=1}^{\infty}$, as $n\to+\infty$ the moduli $\left|\rho_{n}\right|$ grow at least exponentially. Applications to entire…

It is known that if the proximate order $\rho(r)$ such that $\lim \rho(r) = \rho > 0 (r \to \infty)$, then there exists an entire function $f(z)$ of proximate order $\rho(r)$. In the case where $\rho = 0$ the question about the existence of…

We consider a certain class of multiplicative functions $f: \mathbb N \rightarrow \mathbb C$. Let $F(s)= \sum_{n=1}^\infty f(n)n^{-s}$ be the associated Dirichlet series and $F_N(s)= \sum_{n\le N} f(n)n^{-s}$ be the truncated Dirichlet…

The purpose of this paper is to give some explicit formulas involving M\"obius functions, which may be known under the generalized Riemann Hypothesis, but unconditional in this paper. Concretely, we prove explicit formulas of partial sums…

In this short note we prove the following result: If a completely multiplicative function $f:\mathbb{N}\to[-1,1]$ is small on average in the sense that $\sum_{n\leq x}f(n)\ll x^{1-\delta}$, for some $\delta>0$, and if the Dirichlet series…

We introduce and analyse a general class of not necessarily bounded multiplicative functions, examples of which include the function $n \mapsto \delta^{\omega (n)}$, where $\delta \neq 0$ and where $\omega$ counts the number of distinct…

Let $r,\,f$ be multiplicative functions with $r\geqslant 0$, $f$ is complex valued, $|f|\leqslant r$, and $r$ satisfies some standard growth hypotheses. Let $x$ be large, and assume that, for some real number $\tau$, the quantities…

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

Let $f: \mathbb{N} \to \mathbb{C}$ be a multiplicative function for which $$ \sum_{p : \, |f(p)| \neq 1} \frac{1}{p} = \infty. $$ We show under this condition alone that for any integer $h \neq 0$ the set $$ \{n \in \mathbb{N} : f(n) =…

Numerical study of the distribution of the Riemann zeros differences following the work [1] shows the significance of the function for which the prime sum expression is proposed. Computational results related to this definition explored…

Clones of functions play a foundational role in both universal algebra and theoretical computer science. In this work, we introduce clone merge monoids (cm-monoids), a unifying one-sorted algebraic framework that integrates abstract clones,…