Presentations of topological full groups by generators and relations

JOURNAL OF ALGEBRA

卷:500

Article; Proceedings Paper

Grigorchuk, Rostislav¹  Medynets, Kostya² 

[1] Texas A&M, Dept Math, College Stn, TX USA

[2] US Naval Acad, Dept Math, Annapolis, MD 21402 USA

关键词: Finitely generated groups;    Presentations;    Generators;    Relations;    Full groups;    Symbolic dynamics;    Word problem;   

DOI  :  10.1016/j.jalgebra.2016.10.027

来源: Elsevier

【 摘 要 】

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. Published by Elsevier Inc.

【 授权许可】

Free