BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Claremont Center for the Mathematical Sciences - ECPv6.15.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://colleges.claremont.edu/ccms
X-WR-CALDESC:Events for Claremont Center for the Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20180311T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20181104T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20190310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20191103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20200308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20201101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20191029T121500
DTEND;TZID=America/Los_Angeles:20191029T131000
DTSTAMP:20260509T163719
CREATED:20190802T043328Z
LAST-MODIFIED:20190903T050156Z
UID:1347-1572351300-1572354600@colleges.claremont.edu
SUMMARY:Faster point counting for curves over prime power rings (Maurice Rojas\, Texas A&M)
DESCRIPTION:Counting points on algebraic curves over finite fields has numerous applications in communications and cryptology\, and has led to some of the most beautiful results in 20th century arithmetic geometry. A natural generalization is to count the number of points over prime power rings\, e.g.\, the integers modulo a prime power. However\, the theory behind the latter kind of point counting began more recently and there are numerous gaps in our algorithmic knowledge. \nWe give a simple combinatorial construction that reduces point counting over prime power point counting to the prime field case. In particular\, for any bivariate polynomial f in Z[x\,y] and positive integers p and k with p prime\, we show how one can count the number of roots of f in (Z/(p^k))^2 in time p^{1/2 + o(1)} (dk)^{O(1)}\, and even faster for certain curves. This generalizes earlier results of Cheng\, Lecerf\, Saxena\, and Wan in the univariate case\, and simplifies earlier work of Denef\, Igusa\, and Veys on local zeta functions. \nThis is joint work with Caleb Robelle and Yuyu Zhu.
URL:https://colleges.claremont.edu/ccms/event/antc-talk-by-maurice-rojas-texas-am/
LOCATION:Emmy Noether Room\, Millikan 1021\, Pomona College\, 610 N. College Ave.\, Claremont\, California\, 91711
CATEGORIES:Algebra / Number Theory / Combinatorics Seminar
GEO:34.099908;-117.7142522
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=Emmy Noether Room Millikan 1021 Pomona College 610 N. College Ave. Claremont California 91711;X-APPLE-RADIUS=500;X-TITLE=610 N. College Ave.:geo:-117.7142522,34.099908
END:VEVENT
END:VCALENDAR