All Title Author
Keywords Abstract

Mathematics  2007 

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

Full-Text   Cite this paper   Add to My Lib


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 powered by Disqus

Contact Us


微信:OALib Journal