Nilsequences and Multiple Correlations along Subsequences
Abstract: The results of Bergelson-Host-Kra and Leibman say that a multiple polynomial correlation sequence can be decomposed into a sum of a nilsequence (a sequence defined by evaluating a continuous function along an orbit in a nilsystem) and a null sequence (a sequence that goes to zero in density). We refine their results by proving that the null sequence goes to zero in density along polynomials evaluated at primes and Hardy sequence $(\lfloor nc \rfloor)$. On the other hand, given a rigid sequence, we construct an example of correlation whose null sequence does not approach zero in density along that rigid sequence. As a corollary of a lemma in the proof, the formula for the pointwise ergodic average along polynomials of primes in a nilsystem is also obtained.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.