Completely multiplicative functions taking values in {-1,1}

DOI10.1090/S0002-9947-2010-05235-3MaRDI QIDQ3065739zbMATH OpenFDO

Authors Michael Coons, Peter Borwein, Stephen Choi

Publication date 6 January 2011

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0809.1691

zbMATH Keywords

Liouville lambda functionmultiplicative functions

Mathematics Subject Classification ID

Power residues, reciprocity (11A15) Distribution of integers with specified multiplicative constraints (11N25) Asymptotic results on arithmetic functions (11N37)

Abstract: Define {em the Liouville function for $A$}, a subset of the primes $P$, by $lambd{a}_A(n)=(-1{)}^{Omeg{a}_A(n)}$ where $Omeg{a}_A(n)$ is the number of prime factors of $n$ coming from $A$ counting multiplicity. For the traditional Liouville function, $A$ is the set of all primes. Denote ${\displaystyle }$L_A(n):=sum_{kleq n}lambda_A(n)quad{and}quad R_A:=lim_{n oinfty}frac{L_A(n)}{n}.${\displaystyle }$ We show that for every $alphain[0,1]$ there is an $AsubsetP$ such that $R_A=alpha$. Given certain restrictions on $A$, asymptotic estimates for $su{m}_{kleqn}lambd{a}_A(k)$ are also given. With further restrictions, more can be said. For {em character--like functions} $lambd{a}_p$ ($lambd{a}_p$ agrees with a Dirichlet character $chi$ when $chi(n)eq0$) exact values and asymptotics are given; in particular ${\displaystyle }$quadsum_{kleq n}lambda_p(k)ll log n.${\displaystyle }$ Within the course of discussion, the ratio $phi(n)/sigma(n)$ is considered.

Recommendations

• Completely Multiplicative Functions with Special Properties
• On completely multiplicative functions whose values are roots of unity
• Completely multiplicative functions arising from simple operations
• scientific article; zbMATH DE number 6195561
• On Multiplicative Functions of Absolute Value ≦ 1
• scientific article; zbMATH DE number 1142955
• On the pairs of completely multiplicative functions satisfying some relation
• A Characterization of Completely Multiplicative Arithmetic Functions
• scientific article; zbMATH DE number 1019531

Cites work

• A disproof of a conjecture of Pólya
• Automatic Sequences
• Das asymptotische Verhalten von Summen über multiplikative Funktionen. II
• Decay of Mean Values of Multiplicative Functions
• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 3675978 (Why is no real title available?)
• scientific article; zbMATH DE number 1306914 (Why is no real title available?)
• scientific article; zbMATH DE number 2120371 (Why is no real title available?)
• scientific article; zbMATH DE number 2121181 (Why is no real title available?)
• scientific article; zbMATH DE number 3096147 (Why is no real title available?)
• ON THE DIFFERENCE BETWEEN CONSECUTIVE PRIMES
• Sign changes in sums of the Liouville function
• The distribution of the summatory function of the Möbius function
• The Riemann hypothesis. A resource for the afficionado and virtuoso alike
• The spectrum of multiplicative functions

Cited in

(22)

• Zero-sum subsequences in bounded-sum \(\{-1,1\}\)-sequences
• Mock characters and the Kronecker symbol
• The distribution of weighted sums of the Liouville function and Pólya's conjecture
• Multiplicative automatic sequences
• Biases in prime factorizations and Liouville functions for arithmetic progressions
• From the 1-2-3 conjecture to the Riemann hypothesis
• The group of squarefree integers
• Riesz means of certain arithmetic functions
• A note on multiplicative functions resembling the Möbius function
• The Erdös discrepancy problem
• The minimal growth of a k-regular sequence
• Proof of a conjecture of Heath-Brown concerning quadratic residues
• Tao's resolution of the Erdős discrepancy problem
• On the existence of equivalent Dirichlet polynomials whose zeros preserve a topological property
• Multiplicative functions that are close to their mean
• Extremal behaviour of \(\pm 1\)-valued completely multiplicative functions in function fields
• Quadratic characters with positive partial sums
• On asymptotically automatic sequences
• Automatic sequences and parity of partition functions
• On variants of Chowla's conjecture
• -generalized prime factors counting functions
• Computer-aided proof of Erdős discrepancy properties

This page was built for publication: Completely multiplicative functions taking values in ${-1,1}$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3065739)