arXiv Analytics

Sign in

arXiv:0707.0165 [math.GR]AbstractReferencesReviewsResources

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

L. Markus-Epstein

Published 2007-07-02Version 1

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.

Comments: 54 pages with 13 figures
Categories: math.GR
Subjects: 20E06, 20F10
Related articles: Most relevant | Search more
arXiv:0705.0754 [math.GR] (Published 2007-05-05)
Stallings' Foldings and Subgroups of Amalgams of Finite Groups
arXiv:math/0310001 [math.GR] (Published 2003-09-30, updated 2005-10-20)
Representations of polygons of finite groups
arXiv:1409.7903 [math.GR] (Published 2014-09-28)
The Answers to a Problem and Two Conjectures about OD-Characterization of Finite Groups

Links

Toolbox