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 Z which is a set of Bohr recurrence is also a set of topological recurrence? (i) If G is a countable abelian group and E⊂ G is an I0 set, then every subset of E-E which is a set of Bohr recurrence is also a set of topological recurrence. In particular every subset of \2n-2m : n,m∈ N\ which is a set of Bohr recurrence is a set of topological recurrence. (ii) Let Zω be the direct sum of countably many copies of Z with standard basis E. If every subset of (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 p and let Fpω be the direct sum of countably many copies of Z/p Z with basis ( ei)i∈ N. If for every p-uniform hypergraph with vertex set N and edge set F having infinite chromatic number, the Cayley graph on Fpω determined by \Σi∈ F ei:F∈ F\ has infinite chromatic number, then every subset of Fpω which is a set of Bohr recurrence is a set of topological recurrence.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.