BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Utah Math Department//Irreducible specialization over finite fields//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Irreducible specialization over finite fields
X-WR-CALDESC:Irreducible specialization over finite fields at University of Utah Mathematics Department
X-WR-TIMEZONE:America/Denver
BEGIN:VEVENT
UID:20060302T160000-brian-conrad@math.utah.edu
DTSTART;TZID=America/Denver:20060302T160000
DTEND;TZID=America/Denver:20060302T170000
DTSTAMP:20260922T150858Z
SUMMARY:Irreducible specialization over finite fields
DESCRIPTION:Speaker: Brian Conrad\, Univ. of Michigan\n\nIt is a classical and extremely difficult problem to prove theorems about prime values of irreducible polynomials over the integers. For example, it is still not known if there are infinitely many primes of the form n^2 + 1. There is a long history of analogies between the integers and polynomials …

LOCATION:JWB 335

URL:https://www.math.utah.edu/research/colloquia/2006-03-02-brian-conrad/
END:VEVENT
END:VCALENDAR