Ceccherini–Machì–Scarabotti's cellular automata conjecture for non-amenable groups
Statement
Let be a non-amenable finitely generated group, and let be a finite symmetric generating set for . A cellular automaton with is a map determined by a local rule using the memory set . Ceccherini–Machì–Scarabotti's conjecture. There exist cellular automata and with memory set such that has mutually erasable patterns (MEP) but no Garden of Eden patterns (GOE), while 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.