Equivalence of the Logarithmically Averaged Chowla and Sarnak Conjectures

By Terence Tao. 2016

53 citations recorded by the source corpus.

Let λ denote the Liouville function. The Chowla conjecture asserts that $$\displaystyle{\sum _{n\leqslant X}\lambda (a_{1}n + b_{1})\lambda (a_{2}n + b_{2})\ldots \lambda (a_{k}n + b_{k}) = o_{X\rightarrow \infty }(X)}$$ for any fixed natural numbers \(a_{1},a_{2},\ldots,a_{k}\) and non-negative integer \(b_{1},b_{2},\ldots,b_{k}\) with \(a_{i}b_{j} - a_{j}b_{i}\neq 0\) for all \(1\leqslant i <j\leqslant k\), and any \(X\geqslant 1\). This conjecture is open for \(k\geqslant 2\). As is well known, this conjecture implies the conjecture of Sarnak that $$\displaystyle{\sum _{n\leqslant X}\lambda (n)f(n) = o_{X\rightarrow \infty }(X)}$$ whenever \(f: \mathbb{N} \rightarrow \mathbb{C}\) is a fixed deterministic sequence and \(X\geqslant 1\). In this paper, we consider the weaker logarithmically averaged versions of these conjectures, namely that $$\displaystyle{\sum _{X/\omega \leqslant n\leqslant X}\frac{\lambda (a_{1}n + b_{1})\lambda (a_{2}n + b_{2})\ldots \lambda (a_{k}n + b_{k})} {n} = o_{\omega \rightarrow \infty }(\log \omega )}$$ and $$\displaystyle{\sum _{X/\omega \leqslant n\leqslant X}\frac{\lambda (n)f(n)} {n} = o_{\omega \rightarrow \infty }(\log \omega )}$$ under the same hypotheses on \(a_{1},\ldots,a_{k},b_{1},\ldots,b_{k}\) and f, and for any \(2\leqslant \omega \leqslant X\). Our main result is that these latter two conjectures are logically equivalent to each other, as well as to the “local Gowers uniformity” of the Liouville function. The main tools used here are the entropy decrement argument of the author used recently to establish the k = 2 case of the logarithmically averaged Chowla conjecture, as well as the inverse conjecture for the Gowers norms, obtained by Green, Ziegler, and the author.

Subfields: Algebra and Number Theory, Discrete Mathematics and Combinatorics

View Paper: https://www.semanticscholar.org/paper/ecc0fb14ad45de18709bad066f2d950ee45862d2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algebra and Number Theory

  1. Nikos Frantzikinakis
  2. Terence Tao
  3. B. Host
  4. T. Ziegler
  5. Bryna Kra
  6. Ben Joseph Green
  7. William T. Gowers
  8. Joni Teravainen

In Discrete Mathematics and Combinatorics

  1. Nikos Frantzikinakis
  2. Terence Tao
  3. B. Host
  4. Q. Chu
  5. T. Ziegler
  6. Bryna Kra
  7. Ben Joseph Green
  8. M. N. Walsh

Citations in the corpus