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

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!
Beschreibung
Zusammenfassung: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:10.48550/arxiv.1102.2481