Completely multiplicative functions with sum zero over generalised prime systems
In 1903, Landau discovered another proof of the Prime Number Theorem which used relatively weak information about integers. Thirty years later, this gave Beurling the idea that the PNT could be established for a system of `generalized integers`, which are defined as follows: A \textit{generalized prime system}, also called \(g\)-prime system, is a non-decreasing sequence \(\mathcal{P}\) of real numbers \[1 \leqslant p_1 \leqslant p_2 \leqslant \dotsb \leqslant p_n \leqslant \dotsb\] such that \(p_n \to \infty\) as \(n \to \infty\). From these can be formed the system \(\mathcal{N}\) of \textit{Beurling generalized integers}, or \(g\)-integer system, defined as numbers of the shape \(p_1^{a_1} \dotsb p_n^{a_n}\), where \(a_k \in \mathbb{Z}_{\geqslant 1}\). In [Expo. Math. 35, 364--389 (2017; Zbl 1405.11050)], \textit{J.-P. Kahane} and \textit{E. Saias} studied the so-called CMO-functions, i.e., complex-valued completely multiplicative functions \(f\) satisfying \(\sum_{n=1}^\infty f(n) = 0\), and among other things considered the question of the rate of convergence to zero of the partial sums \(\sum_{n \leqslant x} f(n)\). In the paper under review, the author generalizes the work of Kahane and Saias by considering the CMO\(_{\mathcal{P}}\)-functions, i.e. completely multiplicative functions \(f : \mathcal{N} \to \mathbb{C}\) satisfying \(\sum_{n \in \mathcal{N}} f(n) = 0\), where \(\mathcal{N}\) is a \(g\)-integer system. The author investigates several properties of such functions, and also asks about the rate of convergence to zero of the partial sums. For instance, it is proved that, if \(\mathcal{P}\) is a \(g\)-prime system such that all \(g\)-primes are distinct and such that the series \(\sum_{p \in \mathcal{P}} \frac{1}{p \log p}\) converges, then, for all CMO\(_{\mathcal{P}}\)-functions \(f\), the estimate \[\sum_{\substack{n \leqslant x \\ n \in \mathcal{N}}} f(n) = \Omega \left( \frac{1}{x \log x}\right) \] holds. For specific CMO\(_{\mathcal{P}}\)-functions, this result can be refined. For instance, defining the Generalized Liouville function \(\lambda_{\mathcal{P}}\) in an obvious way, the author shows that, if \(\mathcal{P}\) is a \(g\)-prime system such that there exists \(\rho > 0\) such that \[\sum_{\substack{n \leqslant x \\ n \in \mathcal{N}}} 1 = \rho x + O \left( x^\beta \right)\] for some \(\beta < \frac{1}{2}\), then \[\sum_{\substack{n \leqslant x \\ n \in \mathcal{N}}} \frac{\lambda_{\mathcal{P}} (n)}{n} = \Omega \left( \frac{1}{x^{1/2}}\right).\] At the end of the paper, the author surmises that, if \(\mathcal{P}\) is a \(g\)-prime system with abscissa of convergence \(\sigma_c = 1\), then, for all CMO\(_{\mathcal{P}}\)-functions \(f\) \[\sum_{\substack{n \leqslant x \\ n \in \mathcal{N}}} f(n) = \Omega \left( \frac{1}{x^{1/2}}\right).\]
- Completely multiplicative functions of sum zero
- On Euler's example of a completely multiplicative function with sum 0
- Complex valued multiplicative functions with bounded partial sums
- On Euler's example of a completely multiplicative function with sum 0
- Characterising some triplets of completely multiplicative functions
- A generalization of Halász's theorem to Beurling's generalized integers and its application
- A PNT equivalence for Beurling numbers
- A set of generalized numbers showing Beurling's theorem to be sharp
- Analyse de la loi asymptotique de la distribution des nombres premiers généralises
- Beurling generalized numbers
- Beurling integers with RH and large oscillation
- Beurling primes with RH and Beurling primes with large oscillation
- Beurling zeta functions, generalised primes, and fractal membranes
- Completely multiplicative functions of sum zero
- Generalised prime systems with periodic integer counting function
- Halász's theorem for Beurling generalized numbers
- Halász's theorem for Beurling numbers
- scientific article; zbMATH DE number 3343753 (Why is no real title available?)
- On Diamond's \(L^1\) criterion for asymptotic density of Beurling generalized integers
- On PNT equivalences for Beurling numbers
- The average order of the Möbius function for Beurling primes
- Well-behaved Beurling primes and integers
- Completely multiplicative functions of sum zero
- Prime products of general systems
- On Euler's example of a completely multiplicative function with sum 0
- On Euler's example of a completely multiplicative function with sum 0
- Multiplicative functions with sum zero over Beurling generalized prime number systems
- A new generalized prime random approximation procedure and some of its applications
This page was built for publication: Completely multiplicative functions with sum zero over generalised prime systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2221687)
