Compressed decision problems for graph products and applications to (outer) automorphism groups.
DOI10.1142/S0218196712400073zbMATH Open1267.20050MaRDI QIDQ4904513FDOQ4904513
Authors: Niko Haubold, Markus Lohrey, Christian Mathissen 
Publication date: 30 January 2013
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Recommendations
graph productsconjugacy problemouter automorphism groupsright-angled Artin groupsright-angled Coxeter groupsalgorithms for compressed stringscompressed word problemdecision problems for groups
Analysis of algorithms and problem complexity (68Q25) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Automorphism groups of groups (20F28) 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)
Cites Work
- An introduction to right-angled Artin groups.
- Title not available (Why is that?)
- Word Problems Solvable in Logspace
- Algorithms and geometry for graph products of groups
- Combinatorics on traces
- Title not available (Why is that?)
- Polynomial-time word problems.
- Automorphisms of graph groups.
- Group-based cryptography
- Generic-case complexity, decision problems in group theory, and random walks.
- WORD EQUATIONS OVER GRAPH PRODUCTS
- On the algorithmic insolvability of the word problem in group theory
- The word problem
- Peak reduction and finite presentations for automorphism groups of right-angled Artin groups.
- Automorphisms of 2-dimensional right-angled Artin groups.
- Finiteness properties of automorphism groups of right-angled Artin groups
- A Generating Set for the Automorphism Group of a Graph Group
- Asynchronous mappings and asynchronous cellular automata
- A generating set for the automorphism group of a graph product of Abelian groups.
- The conjugacy problem in subgroups of right-angled Artin groups
- Isoperimetric inequalities for nilpotent groups.
- LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE
- The word problem for free partially commutative groups
- Word Problems and Membership Problems on Compressed Words
- Compressed words and automorphisms in fully residually free groups.
- Compressed word problems in HNN-extensions and amalgamated products
- A complex for right-angled Coxeter groups
- Efficient solution of some problems in free partially commutative monoids
- Pattern matching and membership for hierarchical message sequence charts
Cited In (16)
- Logspace and compressed-word computations in nilpotent groups
- Closure properties of knapsack semilinear groups
- Algorithmic problems in right-angled Artin groups: complexity and applications
- Efficient Computation in Groups Via Compression
- Polynomial-time word problems.
- The power word problem in graph products
- Compressed decision problems in hyperbolic groups
- The power word problem in graph products
- Compression techniques in group theory
- Logspace computations in graph products
- Compressed word problems in HNN-extensions and amalgamated products
- Title not available (Why is that?)
- Compressed Word Problems in HNN-Extensions and Amalgamated Products
- Compressed Conjugacy and the Word Problem for Outer Automorphism Groups of Graph Groups
- Compressed words and automorphisms in fully residually free groups.
- Taming the hydra: the word problem and extreme integer compression
This page was built for publication: Compressed decision problems for graph products and applications to (outer) automorphism groups.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904513)
