The periodic coloring conjecture
The periodic coloring conjecture
Let , let be a finite set of primitive, nonzero, mutually incommensurable vectors in , let be a finite color set, and let . For each , choose a fixed primitive vector orthogonal to . Let be the set of tuples of functions satisfying the local condition specified by the source, using a two-dimensional clock .
Periodic coloring conjecture. For any , , , and as above, the solution set is not aperiodic.
This conjecture is presented as an equivalent reformulation of the periodic tiling conjecture in virtually- spaces. The source gives no resolution status.
Sources & referencesView supporting material
Primary source
Rachel Greenfeld, “Translational tilings: structured or wild?”, arXiv:2509.25576 (2025).
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.