Logspace computations in graph groups and Coxeter groups.

DOI10.1007/978-3-642-29344-3_21zbMATH Open1283.20043OpenAlexW129605913MaRDI QIDQ2894469FDOQ2894469

Authors: Volker Diekert, Jonathan Kausch, Markus Lohrey 

Publication date: 29 June 2012

Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29344-3_21

Recommendations

• Logspace computations in Coxeter groups and graph groups.
• Logspace computations in graph products
• Logspace computations in graph products
• On groups that have normal forms computable in logspace.
• Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups

zbMATH Keywords

word problemnormal form theoremsright-angled Artin groupsright-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) Braid groups; Artin groups (20F36) Reflection and Coxeter groups (group-theoretic aspects) (20F55) Geometric group theory (20F65) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Free semigroups, generators and relations, word problems (20M05)

Cited In (7)

• Logspace and compressed-word computations in nilpotent groups
• Non-commutative lattice problems
• Algorithmic problems in right-angled Artin groups: complexity and applications
• Logspace computations in graph products
• Logspace computations in Coxeter groups and graph groups.
• Logspace computations in graph products
• On groups that have normal forms computable in logspace.

This page was built for publication: Logspace computations in graph groups and Coxeter groups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894469)