–
Sala P3.10, Pavilhão de Matemática
How many prime numbers are there in polynomial sequences?
How many prime numbers are there in a sequence of the form $x_0=x$ and $x_{n+1}=f(x_n)$, where $f$ is a polynomial? What does this have to do with Galois theory or even with Markov chains? In this talk, we present an arboreal-type representation as a tool to find primes in polynomial sequences. To achieve the main goal, first we will recall the basics of Galois theory and the concept of regular rooted trees. Then, we state the Chebotarev Density theorem to build a bridge from the Galois groups to the factorization of polynomials in finite fields. In the end, we present a Markov model to study factorization of iterations of cubic polynomials.
Documento adicional
Este seminário será, pela primeira vez, em inglês, e terá uma duração ligeiramente maior do que o habitual. Embora não seja especialmente pensado para alunos mais novos, está aberto a todos os interessados e temos a certeza que aprenderás imenso!