Skip to content

Sets of nice recurrence are partition regular

Jonathan Chapman

math.DSarXiv:2608.20004

Abstract

A set of positive integers R is called a set of nice recurrence if for any measure preserving system (X,μ,T), for all measurable A⊂eq X, and each >0, there exists n∈ R such that μ(A T-nA)≥slant μ(A)2 - . Answering a long-standing question of Bergelson, we show that sets of nice recurrence have the following Ramsey property: any finite colouring of a set of nice recurrence admits a monochromatic set of nice recurrence.

Create a lesson