Computing fixed closures in free groups.

zbMATH Open1226.20019arXiv0910.0713MaRDI QIDQ716396FDOQ716396

Authors: 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

Recommendations

• scientific article; zbMATH DE number 1419260
• Fixed subgroups and computation of auto-fixed closures in free-abelian times free groups
• Algebraic and definable closure in free groups
• Computing equations for residually free groups.
• Recubulating free groups.
• Verbally closed subgroups of free groups
• scientific article
• Finite approximation and commutators in free groups.
• Algorithmic problems for free-Abelian times free groups.
• Efficient separability in free groups.

zbMATH Keywords

automorphismsendomorphismsfixed subgroupsfixed closures in free groups

Mathematics Subject Classification ID

Free nonabelian groups (20E05) Automorphisms of infinite groups (20E36) 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?)
• Topology of finite graphs
• Train tracks and automorphisms of free groups
• Stallings foldings and subgroups of free groups
• CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
• On automorphism-fixed subgroups of a free group
• Endomorphisms of free groups and their fixed points
• ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
• The Group Fixed by a Family of Injective Endomorphisms of a Free Group
• Supports of derivations, free factorizations, and ranks of fixed subgroups in free groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fixed Subgroups are Compressed in Free Groups
• Title not available (Why is that?)
• Examples of retracts in free groups that are not the fixed subgroup of any automorphism.
• On fixed subgroups of maximal rank
• Two examples in the Galois theory of free groups.

Cited In (11)

• A list of applications of Stallings automata
• An algorithm to recognize echelon subgroups of a free group
• Title not available (Why is that?)
• On an algorithm to decide whether a free group is a free factor of another
• Two examples in the Galois theory of free groups.
• Fixed points and stable images of endomorphisms for the free group of rank two
• Normal Forms for Automorphisms of Maximal Rank
• On finite-index extensions of subgroups of free groups.
• Fixed subgroups and computation of auto-fixed closures in free-abelian times free groups
• The Group Fixed by a Family of Injective Endomorphisms of a Free Group
• A McCool Whitehead type theorem for finitely generated subgroups of \(\operatorname{Out}(F_n)\)

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)