Algorithmically complex residually finite groups

Olga Kharlampovich, Alexei Myasnikov, Mark Sapir

Research output: Contribution to journalArticlepeer-review

12 Scopus citations

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.

Original languageEnglish
Pages (from-to)309-352
Number of pages44
JournalBulletin of Mathematical Sciences
Volume7
Issue number2
DOIs
StatePublished - 1 Aug 2017

Keywords

  • Dehn function
  • Depth function
  • Minsky machine
  • Word problem

Fingerprint

Dive into the research topics of 'Algorithmically complex residually finite groups'. Together they form a unique fingerprint.

Cite this