Algorithmically complex residually finite groups

Authors

Olga Kharlampovich, CUNY Hunter CollegeFollow
Alexei Myanikov, Stevens Institute of Technology
Mark Sapir, Vanderbilt University

Document Type

Article

Publication Date

3-20-2017

Abstract

We construct the first examples of algorithmically complex finitely presented residually finite groups and the first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn functions, and arbitrarily large depth functions. The groups are solvable of class 3.

Comments

This article was originally published in Bulletin of Mathematical Sciences, available at DOI 10.1007/s13373-017-0103-z.

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/).