Counting Reducible Matrices, Polynomials, and Surface and Free Group Automorphisms
Author:
Preprint
Abstract
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 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.Keywords
All Related Versions
This publication has 5 references indexed in Scilit:
- The generic irreducibility of the numerator of the zeta function in a family of curves with large monodromyDuke Mathematical Journal, 1997
- Density of integer points on affine homogeneous varietiesDuke Mathematical Journal, 1993
- Train Tracks and Automorphisms of Free GroupsAnnals of Mathematics, 1992
- Automorphisms of Surfaces after Nielsen and Thurston1988
- Number of Points of Varieties in Finite FieldsAmerican Journal of Mathematics, 1954