Katznelson's recurrence conjecture for
Katznelson's recurrence conjecture for
Let be a prime and let be the direct sum of countably many copies of . A set is a set of Bohr recurrence if it intersects every finite-index subgroup of , and a set of chromatic recurrence if its Cayley graph has infinite chromatic number.
Katznelson's finite-field conjecture. Every subset of which is a set of Bohr recurrence is a set of chromatic recurrence.
This is the specialization of the general Katznelson recurrence problem to countably infinite-dimensional vector spaces over finite fields. The paper relates it to the preceding uniform-set conjecture.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
John T. Griesmer, “Special cases and equivalent forms of Katznelson's problem on recurrence”, arXiv:2108.02190 (2022).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.