Katznelson's recurrence conjecture for countably infinite abelian groups
Let be a countably infinite abelian group. A set is a set of Bohr recurrence if it intersects every Bohr neighborhood of , and it is a set of chromatic recurrence if the Cayley graph determined by has infinite chromatic number.
Katznelson's conjecture. If is a set of Bohr recurrence, then is a set of chromatic recurrence.
This is the general form of a question suggested by Veech and popularized by Katznelson. No countably infinite abelian group is currently known for which the answer is settled.
References
- John T. Griesmer, “Special cases and equivalent forms of Katznelson's problem on recurrence”, arXiv:2108.02190 (2022).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.