The conjugacy problem in hyperbolic groups for finite lists of group elements

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

21 pages, 6 figures

Scientific paper

Let G be a word-hyperbolic group with given finite generating set, for which various standard structures and constants have been pre-computed. A (non-practical) algorithm is described that, given as input two lists A and B, each composed of m words in the generators and their inverses, determines whether or not the lists are conjugate in G, and returns a conjugating element should one exist. The algorithm runs in time O(m mu)$, where mu is an upper bound on the lengths of elements in the two lists. Similarly, an algorithm is outlined that computes generators of the centraliser of A, with the same bound on running time.

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

The conjugacy problem in hyperbolic groups for finite lists of group elements 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 conjugacy problem in hyperbolic groups for finite lists of group elements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The conjugacy problem in hyperbolic groups for finite lists of group elements will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-691296

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