Walks on groups, counting reducible matrices, polynomials, and surface and free group automorphisms

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Revision (with different title and many logistical changes) of math.NT/0604489

Scientific paper

We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory, and representation theory) to finite quotients of lattices in semisimple Lie groups (specifically SL(n,Z) and Sp(2n, Z) to show that a ``random'' element in one of these lattices has irreducible characteristic polynomials (over the integers. The term ``random'' can be defined in at least two ways (in terms of height and also in terms of word length in terms of a generating set) -- we show the result using both definitions. We use the above results to show that a random (in terms of word length) element of the mapping class group of a surface is pseudo-Anosov, and that a a random free group automorphism is irreducible with irreducible powers (or strongly irreducible).

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

Walks on groups, counting reducible matrices, polynomials, and surface and free group automorphisms 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 Walks on groups, counting reducible matrices, polynomials, and surface and free group automorphisms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Walks on groups, counting reducible matrices, polynomials, and surface and free group automorphisms will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-31674

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