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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
54 pages with 13 figures

Keywords

Group Theory, 20E06, 20F10

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/132782

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0707.0165
 http://arxiv.org/abs/0707.0165

Collections

arXiv