On an algorithm to decide whether a free group is a free factor of another

DOI10.1051/ita:2007040zbMath1146.20021arXivmath/0609552OpenAlexW2056115496MaRDI QIDQ3515469

Pascal Weil, Pedro V. Silva

Publication date: 29 July 2008

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsfinitely generated subgroupsranksfree groupsinverse automatafree factor groupslengths of generators

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Generators, relations, and presentations of groups (20F05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Algebraic theory of languages and automata (68Q70) Free nonabelian groups (20E05)

Related Items (7)

Stallings automata for free-times-abelian groups: intersections and index ⋮ Relative order and spectrum in free and related groups ⋮ Generic properties of subgroups of free groups and finite presentations ⋮ Primitive words, free factors and measure preservation. ⋮ On finite-index extensions of subgroups of free groups ⋮ AUTOMORPHIC ORBITS IN FREE GROUPS: WORDS VERSUS SUBGROUPS ⋮ A list of applications of Stallings automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A tighter bound for the number of words of minimum length in an automorphic orbit.
• Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
• Topology of finite graphs
• Automorphic orbits in free groups.
• Stallings foldings and subgroups of free groups
• The spectra of lamplighter groups and Cayley machines.
• On Whitehead’s algorithm
• ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
• A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
• ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
• FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
• On fixed subgroups of maximal rank
• CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA

This page was built for publication: On an algorithm to decide whether a free group is a free factor of another