ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a non-amenable finitely generated group, and let SS be a finite symmetric generating set for GG. A cellular automaton with SS is a map determined by a local rule using the memory set SS. Ceccherini–Machì–Scarabotti's conjecture. There exist cellular automata θ1\theta_1 and θ2\theta_2 with memory set SS such that θ1\theta_1 has mutually erasable patterns (MEP) but no Garden of Eden patterns (GOE), while θ2\theta_2 has GOE but no MEP. This proposed converse to the Moore–Myhill theorem would show that both implications fail for every non-amenable finitely generated group; the paper proves the assertion as part of its characterization of amenability, so it is solved.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.