Logspace Computations in Coxeter Groups and Graph Groups

DOI10.1090/conm/582/11553zbMath1283.20044arXiv1201.3174OpenAlexW1876094287MaRDI QIDQ2869260

Volker Diekert, Jonathan Kausch, Markus Lohrey

Publication date: 3 January 2014

Published in: Computational and Combinatorial Group Theory and Cryptography (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.3174

zbMATH Keywords

word problemright-angled Artin groupsnormal form theoremsright-angled Coxeter groupsdeterministic Turing machinesnormal form computationsfree partially commutative inverse monoidslengths of geodesic normal forms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Geometric group theory (20F65) Free semigroups, generators and relations, word problems (20M05) Braid groups; Artin groups (20F36) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (4)

The power word problem in graph products ⋮ Algorithms detecting stability and Morseness for finitely generated groups ⋮ Log-space conjugacy problem in the Grigorchuk group ⋮ Logspace computations in graph products

This page was built for publication: Logspace Computations in Coxeter Groups and Graph Groups