READING OFF KUROSH DECOMPOSITIONS

DOI10.1142/S0218196708004780zbMATH Open1185.20028arXiv0706.0101MaRDI QIDQ3545899FDOQ3545899

Authors: L. Markus-Epstein 

Publication date: 11 December 2008

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

Abstract: Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used by many authors to solve a wide collection of decision problems for free groups and their subgroups. In the present paper we employ our generalized Stallings' folding method to introduce a procedure, which given a subgroup H of a free product of finite groups reads off its Kurosh decomposition from the subgroup graph of H.

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

Recommendations

• STALLINGS FOLDINGS AND SUBGROUPS OF AMALGAMS OF FINITE GROUPS
• A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
• The Grushko decomposition of a finite graph of finite rank free groups: an algorithm.
• Stallings foldings and subgroups of free groups
• An effective version of Stallings' theorem in the case of context-free groups

zbMATH Keywords

finitely generated subgroupsdecision problemslabeled graphssubgroups of free productsKurosh subgroup theoremfree products of finite groupsgeneralized Stallings folding method

Mathematics Subject Classification ID

Free products of groups, free products with amalgamation, Higman-Neumann-Neumann extensions, and generalizations (20E06) Generators, relations, and presentations of groups (20F05) Subgroup theorems; subgroup growth (20E07) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• Topology of finite graphs
• A FAST ALGORITHM FOR STALLINGS' FOLDING PROCESS
• Graphs and separability properties of groups
• FOLDINGS, GRAPHS OF GROUPS AND THE MEMBERSHIP PROBLEM
• Stallings foldings and subgroups of free groups
• CLOSED SUBGROUPS IN PRO-V TOPOLOGIES AND THE EXTENSION PROBLEM FOR INVERSE AUTOMATA
• ON THE COMPLEXITY OF THE WHITEHEAD MINIMIZATION PROBLEM
• FREE INVERSE MONOIDS AND GRAPH IMMERSIONS
• On fixed subgroups of maximal rank
• \texttt{PSPACE}-complete problems for subgroups of free groups and inverse finite automata
• STALLINGS FOLDINGS AND SUBGROUPS OF AMALGAMS OF FINITE GROUPS

Cited In (4)

• The Grushko decomposition of a finite graph of finite rank free groups: an algorithm.
• Subgroups of free groups and primitive elements
• Stallings foldings and subgroups of free groups
• STALLINGS FOLDINGS AND SUBGROUPS OF AMALGAMS OF FINITE GROUPS

This page was built for publication: READING OFF KUROSH DECOMPOSITIONS

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