University of Cambridge > Talks.cam > Probability > Mixing and cut-off for random walks on finite fields and random polynomials

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Mixing and cut-off for random walks on finite fields and random polynomials

Download to your calendar using vCal

If you have a question about this talk, please contact Perla Sousi .

I will report on joint work with Peter Varjú in which we investigate the ax+b random walk on a finite field F_p. Work from the 1990s by Chung-Diaconis-Graham established good upper bounds on mixing time when a=2. We refine their methods to understand the case when a is arbitrary in F_p. Using our previous work on irreducibility of polynomials of large degree, we obtain sharp bounds for the mixing time and prove, conditionally on the Generalized Riemann Hypothesis, that a sharp cut-off occurs.

This talk is part of the Probability series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Authur Marshall Room Meeting the Challenge of Healthy Ageing in the 21st Century Cambridge Café Scientifique

Other talks

Polar Oceans Seminar Talk Title to be confirmed Group Work Proteomics: Expression Analysis and Subcellular Localisation Title to be confirmed Title to be confirmed
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity