On the algorithmic construction of classifying spaces and the isomorphism problem for biautomatic groups

Mathematics – Geometric Topology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

21 pages, 4 figures

Scientific paper

We show that the isomorphism problem is solvable in the class of central extensions of word-hyperbolic groups, and that the isomorphism problem for biautomatic groups reduces to that for biautomatic groups with finite centre. We describe an algorithm that, given an arbitrary finite presentation of an automatic group $\Gamma$, will construct explicit finite models for the skeleta of $K(\Gamma,1)$ and hence compute the integral homology and cohomology of $\Gamma$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

On the algorithmic construction of classifying spaces and the isomorphism problem for biautomatic 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 On the algorithmic construction of classifying spaces and the isomorphism problem for biautomatic groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the algorithmic construction of classifying spaces and the isomorphism problem for biautomatic groups will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-425363

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.