The Word Problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable

We prove that the Word problem in the Baumslag group G(1,2) which has a non-elementary Dehn function is decidable in polynomial time.

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Miasnikov, Alexei, Ushakov, Alexander, Won, Dong Wook
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Group Theory
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	Miasnikov, Alexei Ushakov, Alexander Won, Dong Wook
description	We prove that the Word problem in the Baumslag group G(1,2) which has a non-elementary Dehn function is decidable in polynomial time.
doi_str_mv	10.48550/arxiv.1102.2481
format	Article
fullrecord	<record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1102_2481</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1102_2481</sourcerecordid><originalsourceid>FETCH-LOGICAL-a651-9d07670f2e5a9abe6d111c2534ef89767b50ae98296fdca23f45cd415767ae663</originalsourceid><addsrcrecordid>eNotj09PhDAUxHvxYFbvnsz7AmBbaBeOuv5NNtEDiUfyoA9oAi3pgrrf3q7uaZKZyWR-jN0InuaFUvwOw4_9SoXgMpV5IS5ZXw0Enz4Y-Ai-GWkC62CJ3gOu02HEHvrg1xm-7TIAgvMuodgit2A4wiMNDrrVtYv1DuwBZj8enZ8sjrDYicBQaw3G3St20eF4oOuzblj1_FTtXpP9-8vb7n6foFYiKQ3f6i3vJCkssSFthBCtVFlOXVHGqFEcqSxkqTvTosy6XLUmFypGSFpnG3b7P_sHWs_BTvFnfQKuT8DZL5wxUUE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>The Word Problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable</title><source>arXiv.org</source><creator>Miasnikov, Alexei ; Ushakov, Alexander ; Won, Dong Wook</creator><creatorcontrib>Miasnikov, Alexei ; Ushakov, Alexander ; Won, Dong Wook</creatorcontrib><description>We prove that the Word problem in the Baumslag group G(1,2) which has a non-elementary Dehn function is decidable in polynomial time.</description><identifier>DOI: 10.48550/arxiv.1102.2481</identifier><language>eng</language><subject>Mathematics - Group Theory</subject><creationdate>2011-02</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,778,883</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1102.2481$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1102.2481$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Miasnikov, Alexei</creatorcontrib><creatorcontrib>Ushakov, Alexander</creatorcontrib><creatorcontrib>Won, Dong Wook</creatorcontrib><title>The Word Problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable</title><description>We prove that the Word problem in the Baumslag group G(1,2) which has a non-elementary Dehn function is decidable in polynomial time.</description><subject>Mathematics - Group Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj09PhDAUxHvxYFbvnsz7AmBbaBeOuv5NNtEDiUfyoA9oAi3pgrrf3q7uaZKZyWR-jN0InuaFUvwOw4_9SoXgMpV5IS5ZXw0Enz4Y-Ai-GWkC62CJ3gOu02HEHvrg1xm-7TIAgvMuodgit2A4wiMNDrrVtYv1DuwBZj8enZ8sjrDYicBQaw3G3St20eF4oOuzblj1_FTtXpP9-8vb7n6foFYiKQ3f6i3vJCkssSFthBCtVFlOXVHGqFEcqSxkqTvTosy6XLUmFypGSFpnG3b7P_sHWs_BTvFnfQKuT8DZL5wxUUE</recordid><startdate>20110212</startdate><enddate>20110212</enddate><creator>Miasnikov, Alexei</creator><creator>Ushakov, Alexander</creator><creator>Won, Dong Wook</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20110212</creationdate><title>The Word Problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable</title><author>Miasnikov, Alexei ; Ushakov, Alexander ; Won, Dong Wook</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a651-9d07670f2e5a9abe6d111c2534ef89767b50ae98296fdca23f45cd415767ae663</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Mathematics - Group Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Miasnikov, Alexei</creatorcontrib><creatorcontrib>Ushakov, Alexander</creatorcontrib><creatorcontrib>Won, Dong Wook</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Miasnikov, Alexei</au><au>Ushakov, Alexander</au><au>Won, Dong Wook</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Word Problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable</atitle><date>2011-02-12</date><risdate>2011</risdate><abstract>We prove that the Word problem in the Baumslag group G(1,2) which has a non-elementary Dehn function is decidable in polynomial time.</abstract><doi>10.48550/arxiv.1102.2481</doi><oa>free_for_read</oa></addata></record>
fulltext	fulltext_linktorsrc
identifier	DOI: 10.48550/arxiv.1102.2481
ispartof
issn
language	eng
recordid	cdi_arxiv_primary_1102_2481
source	arXiv.org
subjects	Mathematics - Group Theory
title	The Word Problem in the Baumslag group with a non-elementary Dehn function is polynomial time decidable
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-15T08%3A24%3A22IST&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=The%20Word%20Problem%20in%20the%20Baumslag%20group%20with%20a%20non-elementary%20Dehn%20function%20is%20polynomial%20time%20decidable&rft.au=Miasnikov,%20Alexei&rft.date=2011-02-12&rft_id=info:doi/10.48550/arxiv.1102.2481&rft_dat=%3Carxiv_GOX%3E1102_2481%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