Improved bounds for the two-point logarithmic Chowla conjecture
Cédric Pilatte
Source abstract
Let λ \lambda be the Liouville function, defined as λ ( n ) ≔ ( − 1 ) Ω ( n ) \lambda (n) ≔(-1)^{\Omega (n)} where Ω ( n ) \Omega (n) is the number of prime factors of n n with multiplicity. In 2021, Helfgott and Radziwiłł proved that ∑ n ⩽ x 1 n λ ( n ) λ ( n + 1 ) ≪ log x ( log log x ) 1 / 2 , improving earlier results by Tao and Teräväinen. We prove that ∑ n ⩽ x 1 n λ ( n ) λ ( n + 1 ) ≪ ( log x ) 1 − c for some absolute constant c > 0 c>0 . This appears to be best possible with current methods.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.