Computing fixed closures in free groups.

From MaRDI portal
Publication:716396

zbMATH Open1226.20019arXiv0910.0713MaRDI QIDQ716396FDOQ716396

Enric Ventura Capell

Publication date: 28 April 2011

Published in: Illinois Journal of Mathematics (Search for Journal in Brave)

Abstract: Let F be a finitely generated free group. We present an algorithm such that, given a subgroup HleqslantF, decides whether H is the fixed subgroup of some family of automorphisms, or family of endomorphisms of F and, in the affirmative case, finds such a family. The algorithm combines both combinatorial and geometric methods.


Full work available at URL: https://arxiv.org/abs/0910.0713





Cites Work


Cited In (9)


   Recommendations





This page was built for publication: Computing fixed closures in free groups.

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