Event Detail

Event Type: 
Number Theory Seminar
Tuesday, February 6, 2018 - 16:00 to 17:00
BEXL 323

Speaker Info


A polynomial with integer coefficients yields a family of dynamical systems indexed by primes as follows: for any prime, reduce its coefficients modulo that prime and consider its action on the (finite) residue field. The effectiveness of the Pollard Rho factorization algorithm relies on the ”randomness” of such a family. We show that for many families, the frequency with which cycles of given length appear is not random, but is as random as possible.