2000 character limit reached
Distinguishing sets of strong recurrence from van der Corput Sets
Published 25 Mar 2022 in math.DS | (2203.13804v2)
Abstract: We construct a set of strong recurrence which is not a van der Corput set. This shows that the class of enhanced van der Corput sets is a proper subclass of sets of strong recurrence. In addition, we derive that the class of sets of strong recurrence is not a subclass of van der Corput sets. This answers some questions asked by Bergelson and Lesigne.
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.