English

Special cases and equivalent forms of Katznelson's problem on recurrence

Dynamical Systems 2022-08-02 v2 Combinatorics

Abstract

We make three observations regarding a question popularized by Katznelson: is every subset of Z\mathbb Z which is a set of Bohr recurrence is also a set of topological recurrence? (i) If GG is a countable abelian group and EGE\subset G is an I0I_0 set, then every subset of EEE-E which is a set of Bohr recurrence is also a set of topological recurrence. In particular every subset of {2n2m:n,mN}\{2^n-2^m : n,m\in \mathbb N\} which is a set of Bohr recurrence is a set of topological recurrence. (ii) Let Zω\mathbb Z^{\omega} be the direct sum of countably many copies of Z\mathbb Z with standard basis EE. If every subset of (EE)(EE)(E-E)-(E-E) 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 pp and let Fpω\mathbb F_p^\omega be the direct sum of countably many copies of Z/pZ\mathbb Z/p\mathbb Z with basis (ei)iN(\mathbf e_i)_{i\in \mathbb N}. If for every pp-uniform hypergraph with vertex set N\mathbb N and edge set F\mathcal F having infinite chromatic number, the Cayley graph on Fpω\mathbb F_p^\omega determined by {iFei:FF}\{\sum_{i\in F}\mathbf e_i:F\in \mathcal F\} has infinite chromatic number, then every subset of Fpω\mathbb F_p^\omega 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

R2 v1 2026-06-24T04:50:02.054Z