Algorithmic problems in groups with quadratic Dehn function

DOI10.4171/GGD/694MaRDI QIDQ6356463arXivFDO

Authors Alexander Y. Olshanskii, Mark Sapir

Publication date 18 December 2020

Published in arXiv

Full work available at URL https://doi.org/10.4171/GGD/694

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Word problems, etc. in computability and recursion theory (03D40) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Geometric group theory (20F65)

arXiv classification

math.GR

Abstract: We construct and study finitely presented groups with quadratic Dehn function (QD-groups) and present the following applications of the method developed in our recent papers. (1) The isomorphism problem is undecidable in the class of QD-groups. (2) For every recursive function $f$, there is a QD-group $G$ containing a finitely presented subgroup $H$ whose Dehn function grows faster than $f$. (3) There exists a group with undecidable conjugacy problem but decidable power conjugacy problem; this group is QD.

This page was built for publication: Algorithmic problems in groups with quadratic Dehn function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6356463)