Automorphic orbits in free groups: words versus subgroups.

DOI10.1142/S0218196710005790MaRDI QIDQ3580224zbMATH OpenFDO

Authors Pedro V. Silva, Pascal Weil

Publication date 11 August 2010

Published in International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

automorphisms of free groupsfinitely generated subgroupsorbitsprimitive elementsStallings automata

Mathematics Subject Classification ID

Free nonabelian groups (20E05) Automorphisms of infinite groups (20E36) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Abstract: We show that the following problems are decidable in a rank 2 free group F_2: does a given finitely generated subgroup H contain primitive elements? and does H meet the orbit of a given word u under the action of G, the group of automorphisms of F_2? Moreover, decidability subsists if we allow H to be a rational subset of F_2, or alternatively if we restrict G to be a rational subset of the set of invertible substitutions (a.k.a. positive automorphisms). In higher rank, we show the decidability of the following weaker problem: given a finitely generated subgroup H, a word u and an integer k, does H contain the image of u by some k-almost bounded automorphism? An automorphism is k-almost bounded if at most one of the letters has an image of length greater than k.

Recommendations

• On several problems about automorphisms of the free group of rank two.
• The problem of conjugacy of automorphisms of free groups
• Detecting automorphic orbits in free groups.
• Automorphic orbits in free groups.
• scientific article; zbMATH DE number 1202098

Cites work

• Combinatorics on Words
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• On an algorithm to decide whether a free group is a free factor of another
• On equivalent sets of elements in a free group
• On several problems about automorphisms of the free group of rank two.
• ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
• On Whitehead’s algorithm
• Primitives in the free group on two generators
• Recognizing automorphisms of the free groups
• Stallings foldings and subgroups of free groups
• The existential theory of equations with rational constraints in free groups is PSPACE-complete
• Topology of finite graphs
• What does a basis of F(a,b) look like?

Cited in

(13)

• Some orbits of free words that are determined by measures on finite groups
• Specular sets
• Primitive and almost primitive elements of Schreier varieties
• On several problems about automorphisms of the free group of rank two.
• Cylinders, multi-cylinders and the induced action of (F_n).
• scientific article; zbMATH DE number 1202098 (Why is no real title available?)
• Applications of L systems to group theory
• scientific article; zbMATH DE number 849040 (Why is no real title available?)
• Detecting automorphic orbits in free groups.
• Subsets of groups in public-key cryptography
• Automorphic orbits in free groups: recent progress
• A tighter bound for the number of words of minimum length in an automorphic orbit.
• A recursive presentation for Mihailova's subgroup.

This page was built for publication: Automorphic orbits in free groups: words versus subgroups.

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