Improved bounds for the two-point logarithmic Chowla conjecture

Abstract

Let λ be the Liouville function, defined as λ(n) := (-1)(n) where (n) is the number of prime factors of n with multiplicity. In 2021, Helfgott and Radziwi proved that Σn≤ x 1n λ(n) λ(n+1) x( x)1/2,improving earlier results by Tao and Ter\"av\"ainen. We prove that Σn≤ x 1n λ(n) λ(n+1) ( x)1-cfor some absolute constant c>0. This appears to be best possible with current methods.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…