Algorithmic problems in groups with quadratic Dehn function

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-grou...

Full description

Saved in:
Bibliographic Details
Published in:Groups, geometry and dynamics geometry and dynamics, 2022-01, Vol.16 (4), p.1289-1339
Main Authors: Olshanskii, Alexander Yu, Sapir, Mark V.
Format: Article
Language:English
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 1339
container_issue 4
container_start_page 1289
container_title Groups, geometry and dynamics
container_volume 16
creator Olshanskii, Alexander Yu
Sapir, Mark V.
description 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.
doi_str_mv 10.4171/ggd/694
format article
fullrecord <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_4171_ggd_694</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_4171_ggd_694</sourcerecordid><originalsourceid>FETCH-LOGICAL-c220t-edecd0385f2702b8e352613e684cf9ce7e647d291c89b7520afe3262b5fefa373</originalsourceid><addsrcrecordid>eNo9j01LxDAYhIMouK7iX8jNU918NEmLp2V1VVjwoueQJm-6kX6ZtIj_3ojiaQZmGOZB6JqS25Iqumlbt5F1eYJWVEpaKEbF6b8n6hxdpPROiCwVJyt0t-3aMYb52AeLpzg2HfQJhwG3cVymhD9zhD8W46KZc-MejgP2y2DnMA6X6MybLsHVn67R2_7hdfdUHF4en3fbQ2EZI3MBDqwjvBKeKcKaCrhgknKQVWl9bUFB_uJYTW1VN0owYjxwJlkjPHjDFV-jm99dG8eUIng9xdCb-KUp0T_MOjPrzMy_AT58ShI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Algorithmic problems in groups with quadratic Dehn function</title><source>DOAJ Directory of Open Access Journals</source><creator>Olshanskii, Alexander Yu ; Sapir, Mark V.</creator><creatorcontrib>Olshanskii, Alexander Yu ; Sapir, Mark V.</creatorcontrib><description>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.</description><identifier>ISSN: 1661-7207</identifier><identifier>EISSN: 1661-7215</identifier><identifier>DOI: 10.4171/ggd/694</identifier><language>eng</language><ispartof>Groups, geometry and dynamics, 2022-01, Vol.16 (4), p.1289-1339</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,864,27924,27925</link.rule.ids></links><search><creatorcontrib>Olshanskii, Alexander Yu</creatorcontrib><creatorcontrib>Sapir, Mark V.</creatorcontrib><title>Algorithmic problems in groups with quadratic Dehn function</title><title>Groups, geometry and dynamics</title><description>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.</description><issn>1661-7207</issn><issn>1661-7215</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNo9j01LxDAYhIMouK7iX8jNU918NEmLp2V1VVjwoueQJm-6kX6ZtIj_3ojiaQZmGOZB6JqS25Iqumlbt5F1eYJWVEpaKEbF6b8n6hxdpPROiCwVJyt0t-3aMYb52AeLpzg2HfQJhwG3cVymhD9zhD8W46KZc-MejgP2y2DnMA6X6MybLsHVn67R2_7hdfdUHF4en3fbQ2EZI3MBDqwjvBKeKcKaCrhgknKQVWl9bUFB_uJYTW1VN0owYjxwJlkjPHjDFV-jm99dG8eUIng9xdCb-KUp0T_MOjPrzMy_AT58ShI</recordid><startdate>20220101</startdate><enddate>20220101</enddate><creator>Olshanskii, Alexander Yu</creator><creator>Sapir, Mark V.</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20220101</creationdate><title>Algorithmic problems in groups with quadratic Dehn function</title><author>Olshanskii, Alexander Yu ; Sapir, Mark V.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c220t-edecd0385f2702b8e352613e684cf9ce7e647d291c89b7520afe3262b5fefa373</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Olshanskii, Alexander Yu</creatorcontrib><creatorcontrib>Sapir, Mark V.</creatorcontrib><collection>CrossRef</collection><jtitle>Groups, geometry and dynamics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Olshanskii, Alexander Yu</au><au>Sapir, Mark V.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Algorithmic problems in groups with quadratic Dehn function</atitle><jtitle>Groups, geometry and dynamics</jtitle><date>2022-01-01</date><risdate>2022</risdate><volume>16</volume><issue>4</issue><spage>1289</spage><epage>1339</epage><pages>1289-1339</pages><issn>1661-7207</issn><eissn>1661-7215</eissn><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.</abstract><doi>10.4171/ggd/694</doi><tpages>51</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1661-7207
ispartof Groups, geometry and dynamics, 2022-01, Vol.16 (4), p.1289-1339
issn 1661-7207
1661-7215
language eng
recordid cdi_crossref_primary_10_4171_ggd_694
source DOAJ Directory of Open Access Journals
title Algorithmic problems in groups with quadratic Dehn function
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T20%3A00%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Algorithmic%20problems%20in%20groups%20with%20quadratic%20Dehn%20function&rft.jtitle=Groups,%20geometry%20and%20dynamics&rft.au=Olshanskii,%20Alexander%20Yu&rft.date=2022-01-01&rft.volume=16&rft.issue=4&rft.spage=1289&rft.epage=1339&rft.pages=1289-1339&rft.issn=1661-7207&rft.eissn=1661-7215&rft_id=info:doi/10.4171/ggd/694&rft_dat=%3Ccrossref%3E10_4171_ggd_694%3C/crossref%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c220t-edecd0385f2702b8e352613e684cf9ce7e647d291c89b7520afe3262b5fefa373%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true