# Author Archives: Joel Moreira

## Tao’s Proof of (logarithmically averaged) Chowla’s conjecture for two point correlations

The Liouville function is the completely multiplicative function with for every prime . The Chowla conjecture predicts that this function behaves randomly. Here is a version of this conjecture. Conjecture 1 (Chowla) For every finite set , This conjecture received … Continue reading

## A viewpoint on Katai’s orthogonality criterion

The Liouville function, defined as the completely multiplicative function which sends every prime to , encodes several important properties of the primes. For instance, the statement that is equivalent to the prime number theorem, while the improved (and essentially best … Continue reading

## Entropy of measure preserving systems

A measure preserving system is a quadruple where is a set, is a -algebra, is a probability measure and is a measurable map satisfying for every . The notion of isomorphism in the category of measure preserving systems (defined, for … Continue reading

## Optimal intersectivity

In ergodic Ramsey theory, one often wants to prove that certain dynamically defined sets in a probability space intersect (or “recur”) in non-trivial ways. Typically, this is achieved by studying the long term behavior of the sets as the dynamics … Continue reading

## A proof of the Erdős sumset conjecture

Florian Richter, Donald Robertson and I have uploaded to the arXiv our paper entitled A proof of the Erdős sumset conjecture. The main goal of the paper is to prove the following theorem, which verifies a conjecture of Erdős discussed … Continue reading

## Single and multiple recurrence along non-polynomial sequences

Vitaly Bergelson, Florian Richter and I have recently uploaded to the arXiv our new paper “Single and multiple recurrence along non-polynomial sequences”. In this paper we address the question of what combinatorial structure is present in the set of return … Continue reading

## Erdős Sumset conjecture

Hindman’s finite sums theorem is one of the most famous and useful theorems in Ramsey theory. It states that for any finite partition of the natural numbers, one of the cells of this partition contains an IP-set, i.e., there exists … Continue reading