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

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

2007-07-02

arxiv.org/abs/0707.0165v1

Mathematics

Group Theory

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

Affiliated with

Also associated with

No associations

Rating

Algorithmic Problems in Amalgams of Finite Groups: Conjugacy and Intersection Properties 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: Conjugacy and Intersection Properties, 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: Conjugacy and Intersection Properties will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-692432