Finding tracks in 2-complexes

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

65 pages, 12 figures. This submission replaces the paper Effective Grushko Decompositions, the previous version contains a gap

Scientific paper

We present an algorithm which given a presentation of a group G without 2-torsion, a solution to the word problem with respect to this presentation, and an acylindricity constant {\kappa}, outputs a collection of tracks in an appropriate presentation complex. We give two applications: the first is an algorithm which decides if G admits an essential free decomposition, the second is an algorithm which; if G is relatively hyperbolic; decides if it admits an essential elementary splitting.

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

Finding tracks in 2-complexes 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 Finding tracks in 2-complexes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding tracks in 2-complexes will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-494746

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