Presentations of Topological Full Groups by Generators and Relations
classification
🧮 math.GR
math.DS
keywords
fulltopologicalgeneratorsgroupsrelationscommutatordefiningdescribe
read the original abstract
We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying subshift is recursive.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.