Hilbert's Irreducibility Theorem via Random Walks

Lior Bary-Soroker*, Daniele Garzoni

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

Let be a connected linear algebraic group over a number field, let be a finitely generated Zariski dense subgroup of, and let be a thin set, in the sense of Serre. We prove that, if is either trivial or semisimple and satisfies certain necessary conditions, then a long random walk on a Cayley graph of hits elements of with negligible probability. We deduce corollaries to Galois covers, characteristic polynomials, and fixed points in group actions. We also prove analogous results in the case where is a global function field.

Original languageEnglish
Pages (from-to)12512-12537
Number of pages26
JournalInternational Mathematics Research Notices
Volume2023
Issue number14
DOIs
StatePublished - 1 Jul 2023

Fingerprint

Dive into the research topics of 'Hilbert's Irreducibility Theorem via Random Walks'. Together they form a unique fingerprint.

Cite this