Counting maps from a surface to a graph

Details Counting maps from a surface to a graph Counting maps from a surface to a graph

2005-05-17

arxiv.org/abs/math/0505363v1

Mathematics

Geometric Topology

Scientific paper

Let F be a non-abelian finite rank free group, and let H_g be the fundamental group of a surface of genus g with one boundary component represented by D_g in H_g. So, H_g is the free group and D_g is the product of commutators [a_1,b_1]...[a_g,b_g]. Given x in F, we are interested in the number num(x) of primitive, i.e. root-free, images of monomorphisms (H_g,D_g) -> (F,x). Our main result is that f(g) >= 2^g where f(g)=sup num(x), where sup is taken over all elements x in F. This answers a question of Zlil Sela that is related to his work on the Tarski problem. We also show that f is independent of F and go on to obtain similar results where the monomorphisms considered are additionally required to have minimal genus.

Affiliated with

Also associated with

No associations

Rating

Counting maps from a surface to a 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 Counting maps from a surface to a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting maps from a surface to a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-710267