The one-ended decidable-word-problem characterization of strongly aperiodic SFT groups
Statement
Let ) be a finitely generated group. A group is 1-ended if it has one end in the sense of ends of groups, and it has decidable word problem if there is an algorithm deciding whether a word over a finite generating set represents the identity in . A strongly aperiodic SFT is a subshift of finite type over in which every configuration has trivial stabilizer.
Strongly aperiodic SFT conjecture. A finitely generated group admits a strongly aperiodic SFT if and only if it is 1-ended and has decidable word problem.
The conjecture seeks to characterize groups admitting strongly aperiodic finite-type symbolic dynamics. The cited results give the necessity of one-endedness and, under the stated hypotheses, decidability of the word problem, while many classes of one-ended groups with decidable word problem are known to admit such SFTs; the general equivalence remains open.
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.