## Polynomials, Permutations, Prime Ideals, and factoring Polynomials modulo p

- Date: 07/07/2006

Lecturer(s):

Michael Rosen (Brown University)

Location:

Simon Fraser University

Topic:

The talk began as an attempt to answer the following question - if f(x)

is an irreducible polynomial with integer coefficients, does it remain

irreducible modulo p for infinitely many primes p? It turns out that

the answer is sometimes yes and sometimes no. One can give the answer

satisfactorily and even give the Dirichlet density of the set of p for

which the reduction is irreducible.

Other Information:

SFU/UBC Number Theory Seminar 2006

Joint with PIMS Distinguished Lecture at SFU