Counting Reducible Matrices, Polynomials, and Surface and Free Group Automorphisms

Details Counting Reducible Matrices, Polynomials, and Surface and Free Group Automorphisms Counting Reducible Matrices, Polynomials, and Surface and Free Group Automorphisms

2006-04-23

arxiv.org/abs/math/0604489v2

Mathematics

Number Theory

14 pages; fixed some egregious typos and improved notation

Scientific paper

We give upper bounds on the numbers of various classes of polynomials reducible over the integers and over integers modulo a prime and on the number of matrices in SL(n), GL(n) and Sp(2n) with reducible characteristic polynomials, and on polynomials with non-generic Galois groups. We use our result to show that a random (in the appropriate sense) element of the mapping class group of a closed surface is pseudo-Anosov, and that a random automorphism of a free group is strongly irreducible (aka irreducible with irreducible powers). We also give a necessary condition for all powers of an algebraic integers to be of the same degree, and give a simple proof (in the Appendix) that the distribution of cycle structures modulo a prime p for polynomials with a restricted coefficient is the same as that for general polynomials.

Affiliated with

Also associated with

No associations

Rating

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 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 Counting Reducible Matrices, Polynomials, and Surface and Free Group Automorphisms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-120758