Detecting quasiconvexity: algorithmic aspects

Details Detecting quasiconvexity: algorithmic aspects Detecting quasiconvexity: algorithmic aspects

1995-06-27

arxiv.org/abs/math/9506205v1

Mathematics

Group Theory

AMS-Tex, 7 pages, no figures. To appear in the Proceedings of the DIMACS meeting on Computational Group Theory (March 1994)

Scientific paper

The main result of this paper states that for any group $G$ with an automatic
structure $L$ with unique representatives one can construct a uniform partial
algorithm which detects $L$-rational subgroups and gives their preimages in
$L$. This provides a practical, not just theoretical, procedure for solving the
occurrence problem for such subgroups.

Affiliated with

Also associated with

No associations

Rating

Detecting quasiconvexity: algorithmic aspects 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 Detecting quasiconvexity: algorithmic aspects, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Detecting quasiconvexity: algorithmic aspects will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-681153