Linear equations in primes and dynamics of nilmanifolds

TL;DR

This paper surveys recent advances connecting additive number theory, combinatorics, and ergodic theory to estimate prime solutions for systems of linear equations of finite complexity.

Contribution

It summarizes key ideas and methods that led to Hardy-Littlewood type estimates for primes in linear systems of finite complexity.

Findings

Hardy-Littlewood estimates for prime solutions

Connections between ergodic theory and number theory

Advances in additive combinatorics

Abstract

We survey some of the ideas behind the recent developments in additive number theory, combinatorics and ergodic theory leading to the proof of Hardy- Littlewood type estimates for the number of prime solutions to systems of linear equations of finite complexity.