Table of Contents
Fetching ...

Distribution of neighboring values of the Liouville and Möbius functions

Qi Luo, Yangbo Ye

Abstract

Let $λ(n)$ and $μ(n)$ denote the Liouville function and the Möbius function, respectively. In this study, relationships between the values of $λ(n)$ and $λ(n+h)$ up to $n\leq10^8$ for $1\leq h\leq1,000$ are explored. Chowla's conjecture predicts that the conditional expectation of $λ(n+h)$ given $λ(n)=1$ for $1\leq n\leq X$ converges to the conditional expectation of $λ(n+h)$ given $λ(n)=-1$ for $1\leq n\leq X$ as $X\rightarrow\infty$. However, for finite $X$, these conditional expectations are different. The observed difference, together with the significant difference in $χ^2$ tests of independence, reveals hidden additive properties among the values of the Liouville function. Similarly, such additive structures for $μ(n)$ for square-free $n$'s are identified. These findings pave the way for developing possible, and hopefully efficient, additive algorithms for these functions. The potential existence of fast, additive algorithms for $λ(n)$ and $μ(n)$ may eventually provide scientific evidence supporting the belief that prime factorization of large integers should not be too difficult. For $1\leq h\leq1,000$, the study also tested the convergence speeds of Chowla's conjecture and found no relation on $h$.

Distribution of neighboring values of the Liouville and Möbius functions

Abstract

Let and denote the Liouville function and the Möbius function, respectively. In this study, relationships between the values of and up to for are explored. Chowla's conjecture predicts that the conditional expectation of given for converges to the conditional expectation of given for as . However, for finite , these conditional expectations are different. The observed difference, together with the significant difference in tests of independence, reveals hidden additive properties among the values of the Liouville function. Similarly, such additive structures for for square-free 's are identified. These findings pave the way for developing possible, and hopefully efficient, additive algorithms for these functions. The potential existence of fast, additive algorithms for and may eventually provide scientific evidence supporting the belief that prime factorization of large integers should not be too difficult. For , the study also tested the convergence speeds of Chowla's conjecture and found no relation on .
Paper Structure (5 sections, 20 equations)