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-gro...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Olshanskii, A. Yu Sapir, M. 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.48550/arxiv.2012.10417 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2012_10417</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2012_10417</sourcerecordid><originalsourceid>FETCH-LOGICAL-a677-8e04dc283821a7ce3d342b312e60f5861801f316a0a40afa981fa1ad6fdc34c53</originalsourceid><addsrcrecordid>eNotj8luwjAURb1hUUE_oCv8A0nfsx3HiBWio4TEhn308ACWMtVJOvx9KWV1F_fq6B7GHhByZYoCHil9x89cAIocQWF5x9ab-tSlOJ6baHmfumPtm4HHlp9SN_UD_7pU_GMil2i8LJ78ueVhau0Yu3bBZoHqwd_fcs4OL8-H7Vu227--bze7jHRZZsaDclYYaQRSab10UomjROE1hMJoNIBBoiYgBRRoZTAQktPBWalsIeds-Y-9vq_6FBtKP9WfRXW1kL-o_kIZ</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Algorithmic problems in groups with quadratic Dehn function</title><source>arXiv.org</source><creator>Olshanskii, A. Yu ; Sapir, M. V</creator><creatorcontrib>Olshanskii, A. Yu ; Sapir, M. 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>DOI: 10.48550/arxiv.2012.10417</identifier><language>eng</language><subject>Mathematics - Group Theory</subject><creationdate>2020-12</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><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>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2012.10417$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2012.10417$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Olshanskii, A. Yu</creatorcontrib><creatorcontrib>Sapir, M. V</creatorcontrib><title>Algorithmic problems in groups with quadratic Dehn function</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><subject>Mathematics - Group Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8luwjAURb1hUUE_oCv8A0nfsx3HiBWio4TEhn308ACWMtVJOvx9KWV1F_fq6B7GHhByZYoCHil9x89cAIocQWF5x9ab-tSlOJ6baHmfumPtm4HHlp9SN_UD_7pU_GMil2i8LJ78ueVhau0Yu3bBZoHqwd_fcs4OL8-H7Vu227--bze7jHRZZsaDclYYaQRSab10UomjROE1hMJoNIBBoiYgBRRoZTAQktPBWalsIeds-Y-9vq_6FBtKP9WfRXW1kL-o_kIZ</recordid><startdate>20201218</startdate><enddate>20201218</enddate><creator>Olshanskii, A. Yu</creator><creator>Sapir, M. V</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20201218</creationdate><title>Algorithmic problems in groups with quadratic Dehn function</title><author>Olshanskii, A. Yu ; Sapir, M. V</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a677-8e04dc283821a7ce3d342b312e60f5861801f316a0a40afa981fa1ad6fdc34c53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>Mathematics - Group Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Olshanskii, A. Yu</creatorcontrib><creatorcontrib>Sapir, M. V</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Olshanskii, A. Yu</au><au>Sapir, M. V</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Algorithmic problems in groups with quadratic Dehn function</atitle><date>2020-12-18</date><risdate>2020</risdate><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.48550/arxiv.2012.10417</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2012.10417 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2012_10417 |
| source | arXiv.org |
| subjects | Mathematics - Group Theory |
| title | Algorithmic problems in groups with quadratic Dehn function |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-14T04%3A39%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Algorithmic%20problems%20in%20groups%20with%20quadratic%20Dehn%20function&rft.au=Olshanskii,%20A.%20Yu&rft.date=2020-12-18&rft_id=info:doi/10.48550/arxiv.2012.10417&rft_dat=%3Carxiv_GOX%3E2012_10417%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |