The submonoid and rational subset membership problems for graph groups

Details The submonoid and rational subset membership problems for graph groups The submonoid and rational subset membership problems for graph groups

2006-08-30

arxiv.org/abs/math/0608768v2

Mathematics

Group Theory

Scientific paper

We show that the membership problem in a finitely generated submonoid of a graph group (also called a right-angled Artin group or a free partially commutative group) is decidable if and only if the independence graph (commutation graph) is a transitive forest. As a consequence we obtain the first example of a finitely presented group with a decidable generalized word problem that does not have a decidable membership problem for finitely generated submonoids. We also show that the rational subset membership problem is decidable for a graph group if and only if the independence graph is a transitive forest, answering a question of Kambites, Silva, and the second author. Finally we prove that for certain amalgamated free products and HNN-extensions the rational subset and submonoid membership problems are recursively equivalent. In particular, this applies to finitely generated groups with two or more ends that are either torsion-free or residually finite.

Affiliated with

Also associated with

No associations

Rating

The submonoid and rational subset membership problems for graph 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 The submonoid and rational subset membership problems for graph groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The submonoid and rational subset membership problems for graph groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-397509