Fixed-point-free elements of iterated monodromy groups

Details Fixed-point-free elements of iterated monodromy groups Fixed-point-free elements of iterated monodromy groups

2012-04-12

arxiv.org/abs/1204.2843v1

Mathematics

Dynamical Systems

29 pages, 5 figures

Scientific paper

The iterated monodromy group of a post-critically finite complex polynomial of degree d \geq 2 acts naturally on the complete d-ary rooted tree T of preimages of a generic point. This group, as well as its pro-finite completion, act on the boundary of T, which is given by extending the branches to their "ends" at infinity. We show that for nearly all polynomials, elements that have fixed points on the boundary are rare, in that they belong to a set of Haar measure zero. The exceptions are those polynomials linearly conjugate to multiples of Chebyshev polynomials and a case that remains unresolved, where the polynomial has a non-critical fixed point with many critical pre-images. The proof involves a study of the finite automaton giving the action of generators of the iterated monodromy group, and an application of a martingale convergence theorem. Our result is motivated in part by applications to arithmetic dynamics, where iterated monodromy groups furnish the "geometric part" of certain Galois extensions encoding information about densities of dynamically interesting sets of prime ideals.

Affiliated with

Also associated with

No associations

Rating

Fixed-point-free elements of iterated monodromy 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 Fixed-point-free elements of iterated monodromy groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fixed-point-free elements of iterated monodromy groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-142889