The conjugacy problem in subgroups of right-angled Artin groups
From MaRDI portal
Publication:3644315
DOI10.1112/jtopol/jtp018zbMath1181.20030OpenAlexW1708992577MaRDI QIDQ3644315
John Crisp, Eddy Godelle, Bert Wiest
Publication date: 4 November 2009
Published in: Journal of Topology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jtopol/jtp018
Geometric group theory (20F65) Braid groups; Artin groups (20F36) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (15)
Algorithmic problems in right-angled Artin groups: complexity and applications ⋮ Geometry and Combinatorics via Right-Angled Artin Groups ⋮ The power word problem in graph products ⋮ Conjugacy languages in virtual graph products ⋮ Conjugator lengths in hierarchically hyperbolic groups ⋮ Acylindricity of the action of right-angled Artin groups on extension graphs ⋮ Post's Correspondence Problem for hyperbolic and virtually nilpotent groups ⋮ The word problem for one-relation monoids: a survey ⋮ COMPRESSED DECISION PROBLEMS FOR GRAPH PRODUCTS AND APPLICATIONS TO (OUTER) AUTOMORPHISM GROUPS ⋮ Unnamed Item ⋮ On the Hochschild homology of \(\ell^1\)-rapid decay group algebras ⋮ Conjugacy Length in Group Extensions ⋮ The Conjugacy Ratio of Groups ⋮ Logspace computations in graph products ⋮ Metric systolicity and two-dimensional Artin groups
Cites Work
- Unnamed Item
- Unnamed Item
- Configuration spaces of colored graphs.
- Graph groups are biautomatic
- The geometry of cube complexes and the complexity of their fundamental groups
- Computing the average parallelism in trace monoids.
- Automorphisms of graph groups.
- Embeddings of graph braid and surface groups in right-angled Artin groups and braid groups.
- The geometry and topology of reconfiguration
- On the cohomology rings of tree braid groups.
- Special cube complexes
- Discrete Morse theory and graph braid groups.
- Efficient solution of some problems in free partially commutative monoids
- An introduction to right-angled Artin groups.
- Embedding right-angled Artin groups into graph braid groups.
- A fast string searching algorithm
- Quasi-isometrically embedded subgroups of braid and diffeomorphism groups
- Fast Pattern Matching in Strings
- Algorithms on Strings, Trees and Sequences
- Finding Topology in a Factory: Configuration Spaces
- THE LINEARITY OF THE CONJUGACY PROBLEM IN WORD-HYPERBOLIC GROUPS
This page was built for publication: The conjugacy problem in subgroups of right-angled Artin groups