• Home
  • Search
  • Algorithmic problems in groups with quadratic Dehn function
  • Cite Icon2
  • https://doi.org/10.4171/ggd/694Copy DOI Icon

Algorithmic problems in groups with quadratic Dehn function

Show More
  • Abstract
  • Highlights & Summary
  • Literature Map
  • References
  • Citations
  • Similar Papers
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.

Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.