The Grushko decomposition of a finite graph of finite rank free groups: an algorithm.

DOI10.2140/gt.2005.9.1835zbMath1093.20022arXivmath/0510198OpenAlexW2027685856MaRDI QIDQ813154

Guo-An Diao, Mark E. Feighn

Publication date: 30 January 2006

Published in: Geometry \& Topology (Search for Journal in Brave)

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

zbMATH Keywords

algorithmsfinitely generated groupsfree groupsfreely indecomposable groupsgraphs of groupslabeled graphsfree products of groupsGrushko decompositions

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Geometric group theory (20F65) Free nonabelian groups (20E05) Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Groups acting on trees (20E08)

Related Items

The structure of limit groups over hyperbolic groups ⋮ Vertex links and the Grushko decomposition ⋮ One-ended subgroups of graphs of free groups with cyclic edge groups. ⋮ Detecting geometric splittings in finitely presented groups ⋮ Generic groups acting on regular trees ⋮ A Geometric Proof of the Structure Theorem for Cyclic Splittings of Free Groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combination theorem for negatively curved groups
• Topology of finite graphs
• Decompositions of free groups
• Cyclic splittings of finitely presented groups and the canonical JSJ deccomposition
• Automorphism group of a free group: Centralizers and stabilizers
• Mapping tori of free group automorphisms are coherent
• Irreducible affine varieties over a free group. I: Irreducibility of quadratic equations and Nullstellensatz
• Combinatorial group theory.
• Splittings of mapping tori of free group automorphisms.
• Diophantine geometry over groups. I: Makanin-Razborov diagrams
• JSJ-decompositions of finitely presented groups and complexes of groups.
• Bounding the complexity of simplicial group actions on trees
• On equivalent sets of elements in a free group
• ASCENDING HNN EXTENSIONS OF FINITELY GENERATED FREE GROUPS ARE HOPFIAN
• On Whitehead’s algorithm
• Some remarks on group actions on trees
• ℋ complexes, towers and subgroups of F×F
• On Group-Theoretic Decision Problems and Their Classification. (AM-68)
• On Certain Sets of Elements in a Free Group
• Decomposition of a Group with a Single Defining Relation into a Free Product