Special cases and equivalent forms of Katznelson's problem on recurrence
From MaRDI portal
Publication:6374518
DOI10.1007/S00605-022-01770-6arXiv2108.02190MaRDI QIDQ6374518
Publication date: 4 August 2021
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.
Special sets (thin sets, Kronecker sets, Helson sets, Ditkin sets, Sidon sets, etc.) (43A46) Notions of recurrence and recurrent behavior in topological dynamical systems (37B20)
This page was built for publication: Special cases and equivalent forms of Katznelson's problem on recurrence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6374518)