BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Algebra and Representation Theory Seminar
SUMMARY:Generalizations of self-reciprocal polynomials - S
andro Mattarei (Lincoln)
DTSTART;TZID=Europe/London:20170524T163000
DTEND;TZID=Europe/London:20170524T173000
UID:TALK72648AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/72648
DESCRIPTION:A univariate polynomial with non-constant term is
called self-reciprocal if its sequence of coeffici
ents reads the same backwards. A formula is known
for the number of monic irreducible self-reciproca
l polynomials of a given degree over a finite fiel
d.\nEvery self-reciprocal polynomial of even degre
e 2n over a field can be written as the product of
the nth power of x and a polynomial of degree n
in x + 1/x. We study the problem of counting the i
rreducible polynomials over a finite field that ar
e a product of the nth power of h(x) and a polyno
mial of degree n in the rational expression g(x)/h
(x).
LOCATION:MR12
CONTACT:Christopher Brookes
END:VEVENT
END:VCALENDAR