Algorithmic Problems in Amalgams of Finite Groups

Simple item page
dc.creatorMarkus-Epstein, L.
dc.date2007-05-05
dc.date2007-07-02
dc.date.accessioned2026-07-07T08:13:01Z
dc.date.available2026-07-07T08:13:01Z
dc.descriptionGeometric 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.
dc.description39 pages with 9 figures
dc.identifierhttps://arxiv.org/abs/0705.0759
dc.identifierhttp://arxiv.org/abs/0705.0759
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/132659
dc.subjectGroup Theory
dc.subject20E06, 20F10
dc.titleAlgorithmic Problems in Amalgams of Finite Groups
dc.typetext

Files

Collections

arXiv