Distance in the Ellipticity Graph

Details Distance in the Ellipticity Graph Distance in the Ellipticity Graph

2010-06-24

arxiv.org/abs/1006.4853v1

Mathematics

Group Theory

12 pages

Scientific paper

I.~Kapovich and M.~Lustig defined the ellipticity graph, a curve complex
analogue for free groups. This paper presents an algorithm that uses using
Stallings subgroup $X$-digraphs and Whitehead automorphisms to determine when
the distance between two vertices of the ellipticity graph is two. In addition,
a bound on the distance is obtained using Nielsen transformations.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-676541