Algorithmic problems in groups with quadratic Dehn function
From MaRDI portal
Publication:6356463
Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Turing machines and related notions (03D10) Word problems, etc. in computability and recursion theory (03D40)
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 , there is a QD-group containing a finitely presented subgroup whose Dehn function grows faster than . (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)
