Conjugacy word problem in the tree product of free groups with a cyclic amalgamation

DOI10.1515/DMA-2016-0027zbMATH Open1358.20027OpenAlexW2561881884MaRDI QIDQ501995FDOQ501995

Authors: V. N. Bezverkhniĭ, E. S. Logacheva 

Publication date: 10 January 2017

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2016-0027

Recommendations

• The problem of the conjugation of words in the tree product of free groups with cyclic amalgamation
• The problem of the power conjugacy words in a tree product of free groups with cyclic amalgamation
• scientific article; zbMATH DE number 7120879
• scientific article; zbMATH DE number 703514
• The conjugacy problem for subgroups in a free product of infinite cyclic groups

zbMATH Keywords

conjugacy word problemfree product with amalgamationtree product

Mathematics Subject Classification ID

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The Subgroups of a Free Product of Two Groups with an Amalgamated Subgroup
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalization of Dehn's Result on the Conjugacy Problem

Cited In (10)

• The problem of the power conjugacy words in a tree product of free groups with cyclic amalgamation
• An algorithm that decides conjugacy in a certain generalized free product.
• The conjugacy problem in free solvable groups and wreath products of abelian groups is in \(\mathsf{TC}^0\)
• The conjugacy problem for subgroups in a free product of infinite cyclic groups
• The problem of the conjugation of words in the tree product of free groups with cyclic amalgamation
• On the Conjugacy Problem for Cyclic Extensions of Free Groups
• THE CONJUGACY PROBLEM IS SOLVABLE IN FREE-BY-CYCLIC GROUPS
• Title not available (Why is that?)
• The Conjugacy Problem for Finite Graph Products
• Solution of the generalized conjugacy problem for a free product with commuting subgroups.

This page was built for publication: Conjugacy word problem in the tree product of free groups with a cyclic amalgamation

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