[Colloquium] Colloquium: Algorithmic Solutions to Diophantine Problems (Brian Lawrence)

[Mat Wimberly]

Hi all,

Please find below the zoom link for the UChicago Math Department's next
colloquium on Wednesday, 10/14 at 3:00pm given by Brian Lawrence (University
of Chicago).

If you are not able to attend but would like to see the talk, please let me
know and I will send you the recording.

*Abstract:*

A basic problem in number theory is to find all integer (or rational)
solutions to a system of polynomial equations.  This class of problem,
known as Diophantine problems, includes many questions of traditional
interest.  In 1900, Hilbert asked whether there is a general algorithm to
solve all such problems; work of Matiyasevich and others shows that such an
algorithm does not exist.  The prospects are much better when the system
has only one degree of freedom -- the solution set is a curve.  In 1983,
Faltings proved Mordell's conjecture, showing that a curve of genus at
least 2 has only finitely many rational points.  Since then, significant
progress has been made toward a general algorithm.  I will give an overview
of the subject, including recent developments.
*Zoom Link:*
Topic: Brian Lawrence: Algorithmic Solutions to Diophantine Problem
Time: Oct 14, 2020 03:00 PM Central Time (US and Canada)

https://uchicago.zoom.us/j/94549927215?pwd=b2lkckUyc2xRTkpFUHIvUUhSSFNOUT09

Password: 705710

Thanks,
Mat

-- 
*Mat Wimberly | Project Assistant III*
*matwimberly at math.uchicago.edu <matwimberly at math.uchicago.edu>*
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.cs.uchicago.edu/pipermail/colloquium/attachments/20201008/492a16e8/attachment.html>