Michael Anshel
Abstract
Our purpose is to show the conjugacy problem is solvable for certain $HNN$ groups with many stable letters and in the process investigate conjugate powers in these groups.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Our purpose is to show the conjugacy problem is solvable for certain $HNN$ groups with many stable letters and in the process investigate conjugate powers in these groups.
Key concepts: Conjugate, Conjugacy class, Mathematics, Process (computing), Group (periodic table), Pure mathematics, Computer science, Chemistry