Home The generalized conjugacy problem for virtually free groups
Article
Licensed
Unlicensed Requires Authentication

The generalized conjugacy problem for virtually free groups

  • Manuel Ladra EMAIL logo and Pedro V. Silva
Published/Copyright: April 14, 2010
Forum Mathematicum
From the journal Volume 23 Issue 3

Abstract

The generalized conjugacy problem (has g a conjugate in K for K rational?) is solved for finitely generated (f.g.) virtually free groups with constraints that go beyond the context-free level, a new result for the free group itself. Moldavanskii's theorem on simultaneous conjugacy of f.g. subgroups of a free group is also generalized for virtually free groups and this wider class of constraints. The solution set of the equation x–1gφ(x) ∈ K in the free group (φ a virtually inner automorphism, K rational) is shown to be rational and effectively constructible, and a similar result is proved for the equation xgx–1K in a f.g. virtually free group. The twisted conjugacy problem with context-free constraints is also proved to be decidable for the free group.

Received: 2008-06-17
Published Online: 2010-04-14
Published in Print: 2011-May

© de Gruyter 2011

Downloaded on 8.9.2025 from https://www.degruyterbrill.com/document/doi/10.1515/form.2011.015/pdf
Scroll to top button