Computing fixed closures in free groups.

MaRDI QIDQ716396zbMATH OpenFDO

Authors Enric Ventura Capell

Publication date 28 April 2011

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

Full work available at URL https://arxiv.org/abs/0910.0713, https://projecteuclid.org/euclid.ijm/1299679744

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)

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.

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; zbMATH DE number 1819884
• Finite approximation and commutators in free groups.
• Algorithmic problems for free-Abelian times free groups.
• Efficient separability in free groups.

Cites work

• scientific article; zbMATH DE number 1819884 (Why is no real title available?)
• scientific article; zbMATH DE number 5343239 (Why is no real title available?)
• scientific article; zbMATH DE number 3574107 (Why is no real title available?)
• scientific article; zbMATH DE number 2007816 (Why is no real title available?)
• scientific article; zbMATH DE number 3224578 (Why is no real title available?)
• scientific article; zbMATH DE number 3067686 (Why is no real title available?)
• CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
• Endomorphisms of free groups and their fixed points
• Examples of retracts in free groups that are not the fixed subgroup of any automorphism.
• Fixed Subgroups are Compressed in Free Groups
• ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
• On automorphism-fixed subgroups of a free group
• On fixed subgroups of maximal rank
• Stallings foldings and subgroups of free groups
• Supports of derivations, free factorizations, and ranks of fixed subgroups in free groups
• The Group Fixed by a Family of Injective Endomorphisms of a Free Group
• Topology of finite graphs
• Train tracks and automorphisms of free groups
• Two examples in the Galois theory of free groups.

Cited in

(13)

• 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
• On finite-index extensions of subgroups of free groups.
• Fixed points and stable images of endomorphisms for the free group of rank two
• On an algorithm to decide whether a free group is a free factor of another
• A list of applications of Stallings automata
• Normal Forms for Automorphisms of Maximal Rank
• Dependence over subgroups of free groups
• Two examples in the Galois theory of free groups.
• Eventually fixed points of endomorphisms of virtually free groups
• An algorithm to recognize echelon subgroups of a free group
• A McCool Whitehead type theorem for finitely generated subgroups of \(\operatorname{Out}(F_n)\)
• scientific article; zbMATH DE number 1419260 (Why is no real title available?)

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)