Special cases and equivalent forms of Katznelson's problem on recurrence
Abstract
We make three observations regarding a question popularized by Katznelson: is every subset of which is a set of Bohr recurrence is also a set of topological recurrence? (i) If is a countable abelian group and is an set, then every subset of which is a set of Bohr recurrence is also a set of topological recurrence. In particular every subset of which is a set of Bohr recurrence is a set of topological recurrence. (ii) Let be the direct sum of countably many copies of with standard basis . If every subset of which is a set of Bohr recurrence is also a set of topological recurrence, then every subset of every countable abelian group which is a set of Bohr recurrence is also a set of topological recurrence. (iii) Fix a prime and let be the direct sum of countably many copies of with basis . If for every -uniform hypergraph with vertex set and edge set having infinite chromatic number, the Cayley graph on determined by has infinite chromatic number, then every subset of which is a set of Bohr recurrence is a set of topological recurrence.
Keywords
Cite
@article{arxiv.2108.02190,
title = {Special cases and equivalent forms of Katznelson's problem on recurrence},
author = {John T. Griesmer},
journal= {arXiv preprint arXiv:2108.02190},
year = {2022}
}
Comments
20 pages; v.2 incorporates referee suggestions