BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//prima-2022//speaker calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZOME
TZID:America/Vancouver
TZURL:http://tzurl.org/zoneinfo-outlook/America/Vancouver
X-LIC-LOCATION:America/Vancouver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP;TZID=America/Vancouver:20221208T113000
DTSTART;TZID=America/Vancouver:20221208T113000
DTEND;TZID=America/Vancouver:20221208T122000
UID:20221208T113000@prima2022.primamath.org
SUMMARY:Studying Hilbert's 10th problem via explicit elliptic curves
DESCRIPTION:In 1900, Hilbert posed the following problem: "Given a Diophantine equation with integer coefficients: to devise a process according to which it can be determined in a finite number of operations whether the equation is solvable in (rational) integers."
Building on the work of several mathematicians, in 1970, Matiyasevich proved that this problem has a negative answer, i.e., such a general `process' (algorithm) does not exist.
In the late 1970's, Denef--Lipshitz formulated an analogue of Hilbert's 10th problem for rings of integers of number fields.
In recent years, techniques from arithmetic geometry have been used extensively to attack this problem. One such instance is the work of GarcĂa-Fritz and Pasten (from 2019) which showed that the analogue of Hilbert's 10th problem is unsolvable in the ring of integers of number fields of the form $\mathbb{Q}(\sqrt[3]{p},\sqrt{-q})$ for positive proportions of primes $p$ and $q$. In joint work with Lei and Sprung, we improve their proportions and extend their results in several directions.
STATUS:CONFIRMED
LOCATION:Port Alberni
END:VEVENT
END:VCALENDAR