Affiliation:
1. Cornell University Ithaca, United States
Abstract
In 1971 C. F. Miller associated to every finitely presented group [Formula: see text] a free-by-free group [Formula: see text] known as the Miller Machine, whose conjugacy problem is closely related to the conjugacy and word problems of [Formula: see text]. We quantify this relationship, and look to fully understand the conjugacy problem of [Formula: see text]; namely, we reduce the conjugacy problem in [Formula: see text] to a strong form of list conjugacy in [Formula: see text], which we term iso-computational list conjugacy. As an application, we show that if [Formula: see text] is finite, the conjugacy problem for [Formula: see text] is in [Formula: see text].
Funder
National Science Foundation
Publisher
World Scientific Pub Co Pte Ltd