vix.ing · top · new · best · stats · spec

Algorithmic Problems in Amalgams of Finite Groups: Conjugacy and Intersection Properties

2007/07/02 by L. Markus-Epstein, Markus-Epstein, L.
Mathematics · #20E06 #20F10 #FOS: Mathematics #Group Theory (math.GR) #math.GR #msc:20E06 #msc:20F10

paper · pdf · doi:10.48550/arxiv.0707.0165

54 pages with 13 figures

arxiv created 2007/07/02 · arxiv updated 2009/12/01

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. In the present paper we employ the generalized Stallings' methods, developed by the author, to solve various algorithmic problems concerning finitely generated subgroups of amalgams of finite groups.

Related