Algorithmic Problems in Amalgams of Finite Groups

Details Algorithmic Problems in Amalgams of Finite Groups Algorithmic Problems in Amalgams of Finite Groups

2007-05-05

arxiv.org/abs/0705.0759v2

Mathematics

Group Theory

39 pages with 9 figures

Scientific paper

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. 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.

Affiliated with

Also associated with

No associations

Rating

Algorithmic Problems in Amalgams of Finite Groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Algorithmic Problems in Amalgams of Finite Groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Algorithmic Problems in Amalgams of Finite Groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-28804