Logspace computations in graph groups and Coxeter groups.

DOI10.1007/978-3-642-29344-3_21MaRDI QIDQ2894469zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

deterministic Turing machinesfree partially commutative inverse monoidslengths of geodesic normal formsnormal form computationsnormal form theoremsright-angled Artin groupsright-angled Coxeter groupsword problem

Mathematics Subject Classification ID

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

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

Cited in

(7)

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

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)