Density of jointly periodic points for surjective one-dimensional cellular automata

From papers

Let ΣN\Sigma_N be the space of doubly infinite sequences over an alphabet of NN symbols, and let f:ΣNΣNf:\Sigma_N\to\Sigma_N be a surjective one-dimensional cellular automaton. Let SNS_N be the shift map, and call a point jointly periodic if it is periodic under both ff and SNS_N. A subset of ΣN\Sigma_N is dense if every finite central word occurring in a point of ΣN\Sigma_N also occurs in some point of the subset. Density conjecture. For every surjective one-dimensional cellular automaton, the jointly periodic points are dense. This is a known open question, including in higher dimensions. It is known for closing maps and for surjective maps with a point of equicontinuity; computational evidence shows, in particular, that every span-44 surjective one-dimensional cellular automaton on two symbols has jointly periodic points that are at least 1313-dense.

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

Mike Boyle and Bryant Lee, “Jointly periodic points in cellular automata: computer explorations and conjectures”, arXiv:math/0607178 (2006).

Solutions 0

No solutions have been posted yet.