Distribution of neighboring values of the Liouville and M\"obius functions
Abstract
Let λ(n) and μ(n) denote the Liouville function and the M\"obius function, respectively. In this study, relationships between the values of λ(n) and λ(n+h) up to n≤108 for 1≤ h≤1,000 are explored. Chowla's conjecture predicts that the conditional expectation of λ(n+h) given λ(n)=1 for 1≤ n≤ X converges to the conditional expectation of λ(n+h) given λ(n)=-1 for 1≤ n≤ X as X→∞. 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≤ h≤1,000, the study also tested the convergence speeds of Chowla's conjecture and found no relation on h.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.