The Word Problem and Related Results for Graph Product Groups

DOI10.2307/2043301zbMath0439.20024OpenAlexW4246724038MaRDI QIDQ3881015

Kathy Horadam

Publication date: 1981

Full work available at URL: https://doi.org/10.2307/2043301

zbMATH Keywords

free products with amalgamationgraph productsolvable word problemfundamental group of a graph of groupsextended word problemHNN groupsconjugacy theoremstorsion theorem

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) 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) Fundamental groups and their automorphisms (group-theoretic aspects) (20F34)

Related Items (5)

Amenability of Schreier graphs and strongly generic algorithms for the conjugacy problem ⋮ 2-stratifold groups have solvable word problem ⋮ The Conjugacy Problem for Graph Products with Central Cyclic Edge Groups ⋮ The Conjugacy Problem for Graph Products with Cyclic Edge Groups ⋮ A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Fundamental Groupoid of a Graph of Groups
• An Extension of Greendlinger's Results on the Word Problem
• The Power Problem for Groups with One Defining Relator

This page was built for publication: The Word Problem and Related Results for Graph Product Groups