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

DOI10.2140/GT.2005.9.1835zbMATH Open1093.20022arXivmath/0510198OpenAlexW2027685856MaRDI QIDQ813154FDOQ813154

Authors: Guo-An Diao, Mark Feighn 

Publication date: 30 January 2006

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

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.

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

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

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)

Cites Work

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

Cited In (14)

• 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
• Title not available (Why is that?)
• READING OFF KUROSH DECOMPOSITIONS
• Décomposition d'un groupe en produit libre ou somme amalgamée.
• The structure of limit groups over hyperbolic groups
• Vertex links and the Grushko decomposition
• Title not available (Why is that?)
• 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
• A geometric proof of the structure theorem for cyclic splittings of free groups

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)