Solutions to 6 problems in recurrence and Van der Corput sets

Source abstract

We present solutions to six problems concerning sets of nice recurrence and van der Corput (vdC) sets. We answer a question of Moreira, repeated by Fish and Skinner, by showing that every set of ergodic nice recurrence is a set of nice recurrence. We answer questions of Bergelson as well as Bergelson and Lesigne by showing that every set of nice recurrence is a nice vdC-set, that the family of nice vdC-sets is partition regular, and that the family of sets of nice recurrence is partition regular. We mention that Chapman independently proved that sets of nice recurrence are partition regular. We answer a question of Kelly and Lê, a special case of which was previously asked by Peres, and show that for every nontrivial compact metrizable group $K$, every $K$-vdC set is also a vdC set. Lastly, we answer a question of Farhangi, Rodríguez, and Tucker-Drob and show that for any countably infinite discrete group $G$, a vdC set in $G$ is a set of operatorial recurrence in $G$. The initial solutions to these problems were produced by an AI system. The authors checked their correctness, simplified and reformulated them as clear, human-readable proofs, and situated the resulting contributions within the existing literature.