Reducible fibers and monodromy of polynomial maps
Reducible fibers and monodromy of polynomial maps
-
Danny Neftin, IAS
In-Person and Online Talk
Zoom link: https://princeton.zoom.us/j/97126136441(link is external)
Passcode: The three digit integer that is the cube of the sum of its digits
For a polynomial f∈Q[x], Hilbert's irreducibility theorem asserts that the fiber f−1(a) is irreducible over Q for all values a∈Q outside a "thin" set of exceptions Rf. The problem of describing Rf is closely related to determining the monodromy group of f, and has consequences to arithmetic dynamics, the Davenport-Lewis-Schinzel problem, and to the polynomial version of the question: "can you hear the shape of the drum?". We shall discuss recent progress on describing Rf and its consequences to the above topics.
Based on joint work with Joachim König.