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

DOI10.2140/GT.2005.9.1835MaRDI QIDQ813154zbMATH OpenOpenAlexFDO

Authors Guo-An Diao, Mark 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, https://eudml.org/doc/126285

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Abstract: A finitely generated group admits a decomposition, called its Grushko decomposition, into a free product of freely indecomposable groups. There is an algorithm to construct the Grushko decomposition of a finite graph of finite rank free groups. In particular, it is possible to decide if such a group is free.

Recommendations

• Décomposition d'un groupe en produit libre ou somme amalgamée.
• scientific article; zbMATH DE number 3914557
• scientific article; zbMATH DE number 3875519
• Grushko's theorem
• READING OFF KUROSH DECOMPOSITIONS

Cites work

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

Cited in

(14)

• A geometric proof of the structure theorem for cyclic splittings of free groups
• Detecting geometric splittings in finitely presented groups
• COMPATIBILITY JSJ DECOMPOSITION OF GRAPHS OF FREE ABELIAN GROUPS
• Grushko's theorem
• Generic groups acting on regular trees
• scientific article; zbMATH DE number 3875519 (Why is no real title available?)
• READING OFF KUROSH DECOMPOSITIONS
• The structure of limit groups over hyperbolic groups
• Décomposition d'un groupe en produit libre ou somme amalgamée.
• Vertex links and the Grushko decomposition
• scientific article; zbMATH DE number 2221701 (Why is no real title available?)
• Scott complexity and adjoining roots to finitely generated groups.
• One-ended subgroups of graphs of free groups with cyclic edge groups.
• On a conjecture of Higgins

This page was built for publication: The Grushko decomposition of a finite graph of finite rank free groups: an algorithm.

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