Algorithmic Problems in Amalgams of Finite Groups
From MaRDI portal
Publication:6205531
arXiv0705.0759MaRDI QIDQ6205531FDOQ6205531
Authors: L. Markus-Epstein 
Publication date: 5 May 2007
Abstract: Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. It turns out that Stallings' methods can be effectively generalized for the class of amalgams of finite groups. In the present paper we employ subgroup graphs constructed by the generalized Stallings' folding algorithm to solve various algorithmic problems in amalgams of finite groups.
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)
This page was built for publication: Algorithmic Problems in Amalgams of Finite Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6205531)
