Katznelson's recurrence conjecture for iterated differences in
Katznelson's recurrence conjecture for iterated differences in
Let be the direct sum of countably many copies of , with standard basis . Write , and let denote the set of differences with mutually distinct. A set is a set of Bohr recurrence if it intersects every Bohr neighborhood of , and a set of chromatic recurrence if its associated Cayley graph has infinite chromatic number.
Special Katznelson conjecture. If is a set of Bohr recurrence in , then is a set of chromatic recurrence.
This is a special case of the general recurrence problem and is used in the paper as a sufficient statement for reducing the question to arbitrary countably infinite abelian groups.
Sources & referencesView supporting material
Primary source
John T. Griesmer, “Special cases and equivalent forms of Katznelson's problem on recurrence”, arXiv:2108.02190 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.