An inverse of Furstenberg’s correspondence principle and applications to van der Corput sets
We obtain an inverse of Furstenberg’s correspondence principle in the setting of countable cancellative, amenable semigroups. Besides being of intrinsic interest on its own, this result allows us to answer a variety of questions concerning sets of recurrence and van der Corput (vdC) sets, which were posed by Bergelson and Lesigne [Colloq. Math. 110 (2008), pp. 1–49], Bergelson and Ferré Moragues [Israel J. Math. 245 (2021), pp. 921–962], Kelly and Lê [Arch. Math. (Basel) 110 (2018), pp. 343–349], and Moreira [ <italic>Sets of nice recurrence</italic> , I Can’t Believe It’s Not Random, https://joelmoreira.wordpress.com/2013/03/04/323/]. We also prove a spectral characterization of vdC sets and prove some of their basic properties in the context of countable amenable groups. Several results in this article were independently found by Sohail Farhangi and Robin Tucker-Drob, see [ <italic>Asymptotic dynamics on amenable groups and van der Corput sets</italic> , Preprint, arXiv: <ext-link xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="https://arxiv.org/abs/2409.00806">2409.00806</ext-link> , 2024].
Authors
- Saúl Rodríguez Martín
Institutions
- The Ohio State University (US)
Publication Details
- Journal
- Transactions of the American Mathematical Society
- Published
- 2025-09-04
- DOI
- https://doi.org/10.1090/tran/9480
- Primary Topic
- Limits and Structures in Graph Theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00