BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Daniel E. Martin (University of Colorado)
DTSTART:20200704T170000Z
DTEND:20200704T173000Z
DTSTAMP:20260423T200201Z
UID:ANTS14/29
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/ANTS14/29/">
 Short vector problems and simultaneous approximation</a>\nby Daniel E. Mar
 tin (University of Colorado) as part of Algorithmic Number Theory Symposiu
 m (ANTS XIV)\n\n\nAbstract\nIn 1982\, Lagarias showed that solving the app
 roximate Shortest Vector Problem also solves the problem of finding simult
 aneous Diophantine approximations. Here we provide the reverse reduction w
 ith polynomial complexity. It is gap-preserving provided a consistent norm
  is used to measure approximation quality in both problems. We also give a
 n alternative to the Lagarias algorithm by first reducing his version of s
 imultaneous approximation to one with no explicit range in which a solutio
 n is sought.\n\nThe slides used in the pre-recorded video can be found <a 
 href="https://math.mit.edu/~drew/ANTSXIV/ReductionsShortVectorVideoSlides.
 pdf">here</a>.\n\nChair: Divesh Aggarwal and Emmanuel Thomé\n
LOCATION:https://researchseminars.org/talk/ANTS14/29/
END:VEVENT
END:VCALENDAR